Most of earlier grid scheduling algorithms were based on centralized scheduler. Relying on central scheduler yields not only central point of failure, also, it is not possible because of scalability and political issues in present day gigantic grid systems. Hence, meta-schedulers came into limelight. However many authors recognizes limitations of hierarchical grid scheduling and proposed peer-to-peer (P2P) techniques, which have potential for grid scheduling. In this paper, new decentralized scheduling algorithm is proposed for P2P grid systems. In this method, an independent task sovereignly selects a most suitable grid node based on local information of immediate neighbors. A vital feature of this method is that it can schedule both computation intensive and communication intensive tasks to make grid system's workload balanced.
{"title":"Decentralized Computation and Communication Intensive Task Scheduling Algorithm for P2P Grid","authors":"P. Chauhan, Nitin","doi":"10.1109/UKSim.2012.78","DOIUrl":"https://doi.org/10.1109/UKSim.2012.78","url":null,"abstract":"Most of earlier grid scheduling algorithms were based on centralized scheduler. Relying on central scheduler yields not only central point of failure, also, it is not possible because of scalability and political issues in present day gigantic grid systems. Hence, meta-schedulers came into limelight. However many authors recognizes limitations of hierarchical grid scheduling and proposed peer-to-peer (P2P) techniques, which have potential for grid scheduling. In this paper, new decentralized scheduling algorithm is proposed for P2P grid systems. In this method, an independent task sovereignly selects a most suitable grid node based on local information of immediate neighbors. A vital feature of this method is that it can schedule both computation intensive and communication intensive tasks to make grid system's workload balanced.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128078563","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Verdiere, A. Rezgui, S. Gaaloul, B. Delinchant, L. Gerbaud, F. Wurtz, X. Brunotte
Modelica modelling language is increasingly used in engineering. It defines differential algebraic equations (DAE) which can be solved using numerical algorithms. In order to solve a DAE, Jacobian of the model is required. In this paper, a full Java implementation of Modelica model generator is made using Automatic Differentiation (AD). The generated model is packaged in a software component standard in order to be plugged in different solvers (DAE, ODE, and Optimization). Depending on the static or dynamic nature of Modelica models, the treatment is adapted in order to take advantage of automatic differentiation. Especially, in the case of static model, a Jacobian is given as sensitivity information to the optimization algorithm.
{"title":"Modelica Models Translation into Java Components for Optimization and DAE Solving Using Automatic Differentiation","authors":"F. Verdiere, A. Rezgui, S. Gaaloul, B. Delinchant, L. Gerbaud, F. Wurtz, X. Brunotte","doi":"10.1109/UKSim.2012.56","DOIUrl":"https://doi.org/10.1109/UKSim.2012.56","url":null,"abstract":"Modelica modelling language is increasingly used in engineering. It defines differential algebraic equations (DAE) which can be solved using numerical algorithms. In order to solve a DAE, Jacobian of the model is required. In this paper, a full Java implementation of Modelica model generator is made using Automatic Differentiation (AD). The generated model is packaged in a software component standard in order to be plugged in different solvers (DAE, ODE, and Optimization). Depending on the static or dynamic nature of Modelica models, the treatment is adapted in order to take advantage of automatic differentiation. Especially, in the case of static model, a Jacobian is given as sensitivity information to the optimization algorithm.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127481084","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Credit risk, deriving from borrowers defaulting on their debts, represents an ever growing source of concern for financial operators. An established model to describe the associated risk scenario, where correlation among defaults is present, is the t-copula, whose use allows us to evaluate the probability of losses exceeding a given threshold. However, the typically large number of variables involved calls for a simulation approach. A simulation method, based on the use of the Cross-Entropy (CE) technique, is here proposed as an alternative to non-adaptive Importance Sampling (IS) techniques so far presented in the literature, the main advantage of CE being that it allows to deal easily with a wider range of probability models than ad hoc IS. A full description of the method is provided along with the results obtained for an extended set of model instances. The proposed Cross-Entropy technique is shown to provide accurate results even when the sample size is several orders of magnitude smaller than the inverse of the probability to be estimated.
{"title":"Simulation of Correlated Financial Defaults through Smoothed Cross-Entropy","authors":"G. D'Acquisto, L. Mastroeni, M. Naldi","doi":"10.1109/UKSim.2012.27","DOIUrl":"https://doi.org/10.1109/UKSim.2012.27","url":null,"abstract":"Credit risk, deriving from borrowers defaulting on their debts, represents an ever growing source of concern for financial operators. An established model to describe the associated risk scenario, where correlation among defaults is present, is the t-copula, whose use allows us to evaluate the probability of losses exceeding a given threshold. However, the typically large number of variables involved calls for a simulation approach. A simulation method, based on the use of the Cross-Entropy (CE) technique, is here proposed as an alternative to non-adaptive Importance Sampling (IS) techniques so far presented in the literature, the main advantage of CE being that it allows to deal easily with a wider range of probability models than ad hoc IS. A full description of the method is provided along with the results obtained for an extended set of model instances. The proposed Cross-Entropy technique is shown to provide accurate results even when the sample size is several orders of magnitude smaller than the inverse of the probability to be estimated.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124123663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We describe the depth of field A buffer, a new method for generating depth of field effects in synthesised images. The method avoids the use of multiple discrete samples but still has the capability to produce the effect of a sharp object viewed through a de-focussed one. Initial rendering can be done via a system producing pixel contributions together with depth information as required by conventional Z buffering. We present sample images illustrating the advantages of the technique compared to multi-sampling. We discuss the options for hardware-accelerated implementation and possible applications.
{"title":"Creating Depth of Field Effects without Multiple Samples","authors":"R. Cant, C. Langensiepen","doi":"10.1109/UKSim.2012.30","DOIUrl":"https://doi.org/10.1109/UKSim.2012.30","url":null,"abstract":"We describe the depth of field A buffer, a new method for generating depth of field effects in synthesised images. The method avoids the use of multiple discrete samples but still has the capability to produce the effect of a sharp object viewed through a de-focussed one. Initial rendering can be done via a system producing pixel contributions together with depth information as required by conventional Z buffering. We present sample images illustrating the advantages of the technique compared to multi-sampling. We discuss the options for hardware-accelerated implementation and possible applications.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125026228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. A. Ajibesin, N. Ventura, H. Chan, A. Murgu, Olubola K. Egunsola
Multicast can be described as the process of routing information from a source node s to a set of receivers r1, r2⋯⋯rn. In this paper, we present the performance of multicast algorithms in wireless networks. A network coding (NC) algorithm, which is the proposed optimised model, and efficient for multicast networks is considered. This model is implemented for wireless networks and the simulation results are compared with the Multicast Incremental Power (MIP) algorithm. MIP algorithm is one of the existing approaches for finding minimum cost on multicast wireless networks. Simulation results show that optimisation using network coding method lead to substantial improvement in the cost associated with multicast wireless network. This is because network resources are shared in an innovative manner that is more efficient than traditional method of processing data transmissions, which are generally sub-optimal.
{"title":"Performance of Multicast Algorithms over Coded Packet Wireless Networks","authors":"A. A. Ajibesin, N. Ventura, H. Chan, A. Murgu, Olubola K. Egunsola","doi":"10.1109/UKSim.2012.91","DOIUrl":"https://doi.org/10.1109/UKSim.2012.91","url":null,"abstract":"Multicast can be described as the process of routing information from a source node s to a set of receivers r1, r2⋯⋯rn. In this paper, we present the performance of multicast algorithms in wireless networks. A network coding (NC) algorithm, which is the proposed optimised model, and efficient for multicast networks is considered. This model is implemented for wireless networks and the simulation results are compared with the Multicast Incremental Power (MIP) algorithm. MIP algorithm is one of the existing approaches for finding minimum cost on multicast wireless networks. Simulation results show that optimisation using network coding method lead to substantial improvement in the cost associated with multicast wireless network. This is because network resources are shared in an innovative manner that is more efficient than traditional method of processing data transmissions, which are generally sub-optimal.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130475559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents the description of a simulation environment developed for the purposes of the evaluation of the performance of autonomic cooperative networking. The work is done in context of emergency communications and a very specific scenario of an indoor type is applied being sufficiently well tailored to the needs of showing the necessity for the incorporation of the investigated concepts. The context of emergency communications, in fact, allows for an analysis of dynamic network set-ups where the system needs to provide best possible communication capabilities in the area of incident. For this reason, issues such as energy constraints and battery drainage play secondary role, allowing for the development of way more advanced concepts as compared to commercial networked systems.
{"title":"Simulation Environment for Autonomic Cooperative Networking in Indoor Scenario","authors":"M. Wódczak","doi":"10.1109/UKSim.2012.89","DOIUrl":"https://doi.org/10.1109/UKSim.2012.89","url":null,"abstract":"This paper presents the description of a simulation environment developed for the purposes of the evaluation of the performance of autonomic cooperative networking. The work is done in context of emergency communications and a very specific scenario of an indoor type is applied being sufficiently well tailored to the needs of showing the necessity for the incorporation of the investigated concepts. The context of emergency communications, in fact, allows for an analysis of dynamic network set-ups where the system needs to provide best possible communication capabilities in the area of incident. For this reason, issues such as energy constraints and battery drainage play secondary role, allowing for the development of way more advanced concepts as compared to commercial networked systems.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126062744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hojat Dehnavi, M. Movahhedy, A. Naebi, Soleyman Pasban
In high speed machining, friction between the moving parts, generates heat. One of the major causes of thermal errors in linear axes is the heat generated in ball screw during operation at high speed. Thermal errors affect the accuracy of the linear axes and can cause a deviation from the nominal machining circular motion. The subject of this paper is to study the effects of feed velocity and ball screw Preload on the accuracy of circular motion. The temperature rise in the ball screw is measured by a laser thermometer. The errors in the linear and circular motions are measured by laser interferometer and ball bar. Training a neural network by the test results, thermal errors in all parts of a ball screw are predicted and compared with other test results.
{"title":"Prediction of the Effect of Heat Generation in Ballscrew on the Accuracy of CNC Milling Machine","authors":"Hojat Dehnavi, M. Movahhedy, A. Naebi, Soleyman Pasban","doi":"10.1109/UKSim.2012.47","DOIUrl":"https://doi.org/10.1109/UKSim.2012.47","url":null,"abstract":"In high speed machining, friction between the moving parts, generates heat. One of the major causes of thermal errors in linear axes is the heat generated in ball screw during operation at high speed. Thermal errors affect the accuracy of the linear axes and can cause a deviation from the nominal machining circular motion. The subject of this paper is to study the effects of feed velocity and ball screw Preload on the accuracy of circular motion. The temperature rise in the ball screw is measured by a laser thermometer. The errors in the linear and circular motions are measured by laser interferometer and ball bar. Training a neural network by the test results, thermal errors in all parts of a ball screw are predicted and compared with other test results.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126224103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The new paradigm of cloud computing infrastructure can be described as an integrated approach for restructuring processes in all functions considering customer values. Now a massive restructuring process based paradigm shift is required to address excellence with respect to criteria like cost, quality, delivery and service. This paper provides a good solution for enterprises to improve the utilization benefit of information resources in Cloud computing arena using simulation and modeling approach for the private cloud provisioning, cloud business process workflow design, ticketing system, change management etc. By the application of system dynamics, this paper conducts a qualitative and quantitative research on mechanism of information resources allocation in cloud computing, managed & shared services, Infrastructure management business process modeling (BPM) and simulation. The paper aims to create a dynamic cloud business process modeling mechanisms which helps managers understand better the dynamic interrelationships in organization design and, in particular, the interrelationships between an organization's profitability (both short-term and long-term) and investment in cloud computing and overall infrastructure. The intention of this paper is to put forward a conceptual framework of simulation and modeling framework, for assisting management in handling cloud workflow design, service management and business process modeling.
{"title":"Cloud Management Simulation and Design","authors":"K. Saurabh, Rishi Ranjan","doi":"10.1109/UKSim.2012.79","DOIUrl":"https://doi.org/10.1109/UKSim.2012.79","url":null,"abstract":"The new paradigm of cloud computing infrastructure can be described as an integrated approach for restructuring processes in all functions considering customer values. Now a massive restructuring process based paradigm shift is required to address excellence with respect to criteria like cost, quality, delivery and service. This paper provides a good solution for enterprises to improve the utilization benefit of information resources in Cloud computing arena using simulation and modeling approach for the private cloud provisioning, cloud business process workflow design, ticketing system, change management etc. By the application of system dynamics, this paper conducts a qualitative and quantitative research on mechanism of information resources allocation in cloud computing, managed & shared services, Infrastructure management business process modeling (BPM) and simulation. The paper aims to create a dynamic cloud business process modeling mechanisms which helps managers understand better the dynamic interrelationships in organization design and, in particular, the interrelationships between an organization's profitability (both short-term and long-term) and investment in cloud computing and overall infrastructure. The intention of this paper is to put forward a conceptual framework of simulation and modeling framework, for assisting management in handling cloud workflow design, service management and business process modeling.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126241148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Marwa Hassan, M. Hossny, S. Nahavandi, D. Creighton
Time series forecasting attempts to predict future values of time series. Its work is based on studying previously observed values. A heteroskedastic time series features variable and unpredictable measures of dispersion. This uncertainty in statistical distribution parameters imposes a serious challenge to the forecasting models. There have been many attempts to identify the heteroskedasticity in time series. However, all these attempts rely on hypothesis testing and do not quantify the amount of heteroskedasticity in the examined time series. On the other hand, quantifying heteroskedasticity does provide extra information about the behavior of the time series. Studying this behavior will improve forecasting of behavioral dependent time series such as stock market data. This paper introduces a novel heteroskedasticity index based on variance of localized variances.
{"title":"Heteroskedasticity Variance Index","authors":"Marwa Hassan, M. Hossny, S. Nahavandi, D. Creighton","doi":"10.1109/UKSim.2012.28","DOIUrl":"https://doi.org/10.1109/UKSim.2012.28","url":null,"abstract":"Time series forecasting attempts to predict future values of time series. Its work is based on studying previously observed values. A heteroskedastic time series features variable and unpredictable measures of dispersion. This uncertainty in statistical distribution parameters imposes a serious challenge to the forecasting models. There have been many attempts to identify the heteroskedasticity in time series. However, all these attempts rely on hypothesis testing and do not quantify the amount of heteroskedasticity in the examined time series. On the other hand, quantifying heteroskedasticity does provide extra information about the behavior of the time series. Studying this behavior will improve forecasting of behavioral dependent time series such as stock market data. This paper introduces a novel heteroskedasticity index based on variance of localized variances.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129774099","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Sanz, P. J. Piñero-Escuer, D. Montoro-Mouzo, J.I. Garcia-Nicolas
The smart grid technology, that intends to provide intelligence to the energy distribution infrastructure, is one of the more promising technological advances in the near future. One of the main components of this smart grid is an advanced metering infrastructure (AMI), which replaces the analog meters with computerized systems that report usage over digital communication interfaces. Among the different technologies that can be employed to deploy a smart metering infrastructure, PRIME standard has recently attracted a lot of interest. However, PRIME networks planning and standard code development is still a very hard task as it is very expensive to emulate a real network in a laboratory. In this paper it is presented a precise and powerful tool for simulating real PRIME networks in a very accurate manner. This tool permits high accuracy real code testing and real networks planning.
{"title":"Distributed Event-Driven Simulation Environment for PRIME Based Metering Networks Planning","authors":"A. Sanz, P. J. Piñero-Escuer, D. Montoro-Mouzo, J.I. Garcia-Nicolas","doi":"10.1109/UKSim.2012.72","DOIUrl":"https://doi.org/10.1109/UKSim.2012.72","url":null,"abstract":"The smart grid technology, that intends to provide intelligence to the energy distribution infrastructure, is one of the more promising technological advances in the near future. One of the main components of this smart grid is an advanced metering infrastructure (AMI), which replaces the analog meters with computerized systems that report usage over digital communication interfaces. Among the different technologies that can be employed to deploy a smart metering infrastructure, PRIME standard has recently attracted a lot of interest. However, PRIME networks planning and standard code development is still a very hard task as it is very expensive to emulate a real network in a laboratory. In this paper it is presented a precise and powerful tool for simulating real PRIME networks in a very accurate manner. This tool permits high accuracy real code testing and real networks planning.","PeriodicalId":405479,"journal":{"name":"2012 UKSim 14th International Conference on Computer Modelling and Simulation","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124730858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：