Resource scheduling based on SLA(Service Level Agreement) in cloud computing is NP-hard problem. there is no efficient method to solve it. this paper proposes a new method to solve the problem by applying stochastic i...
详细信息
As part of a major EU infrastructure project (SCIEnce: symboliccomputing Infrastructure in Europe), we are developing SymGrid, a new framework that will, for the first time, allow multiple invocations of symbolic com...
详细信息
ISBN:
(纸本)0769530788
As part of a major EU infrastructure project (SCIEnce: symboliccomputing Infrastructure in Europe), we are developing SymGrid, a new framework that will, for the first time, allow multiple invocations of symboliccomputing applications to interact via the Grid. SymGrid is designed to support the specific needs of symbolic computation, including computational steering (greater interactivity), complex data structures, and domain-specific computational patterns (for irregular parallelism). A key issue for the SymGrid design is heterogeneity: SymGrid is designed to orchestrate legacy components from different symbolic systems into a single coherent (possibly parallel) Grid application, building on the OpenMath standard for data exchange between mathematically-oriented applications. SymGrid comprises two main parts: SymGrid-Services and SymGrid-Par. SymGrid-Service provides a set of WSRF-compliant interfaces from symbolic computations to both Grid and Web services, and allows straightforward encapsulation of symbolic computations as Grid service components, including automatic client generation. Complementing this, SymGrid-Par provides high-level orchestratation of symbolic components into (parallel) Grid-enabled applications. Each component executes within an instance of a Grid-enabled engine, which can be geographically distributed to form a wide-area computational Grid, built as a loosely-coupled collection of Grid-enabled clusters. We have constructed implementations of both SymGridServices and SymGrid-Par. While we do not yet have performance results for a wide-area computational Grid, our initial results show that good performance can be achieved both on modern multicore systems and on clusters of workstations. We demonstrate that for a number of simple, but representative testbed applications, good parallel speedup is possible over a sequential, optimised computer algebra system running on a single processor/core. In particular, we are able to achieve relative sp
this paper presents an overview of the initiative based on non-commercial software, which is being carried out in the University of La Rioja, to develop an e-Science and e-Learning Web-Site withthe aim to encourage o...
详细信息
Accurate forecasting of solar energy production is highly important for an adequate integration of renewable energy into the power grid. this study explores the importance of various predictors for enhancing the accur...
详细信息
the mathematical backbone of this article is formed by three classical formulas of Wallis: his product formula for π, an inequality implying the product formula in the limit, and a related definite integral involving...
详细信息
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numericalgorithms to solve polynomial systems. We describe the design and implementation of ...
详细信息
ISBN:
(数字)9783319240213
ISBN:
(纸本)9783319240213;9783319240206
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numericalgorithms to solve polynomial systems. We describe the design and implementation of our web interface and reflect on the application of polynomial homotopy continuation methods to solve polynomial systems in the cloud. Via the graph isomorphism problem we organize and classify the polynomial systems we solved. the classification withthe canonical form of a graph identifies newly submitted systems with systems that have already been solved.
the computation of strongly connected components (SCCs) in discrete-state models is a critical step in formal verification of LTL and fair CTL properties, but the potentially huge number of reachable states and SCCs c...
详细信息
the computation of strongly connected components (SCCs) in discrete-state models is a critical step in formal verification of LTL and fair CTL properties, but the potentially huge number of reachable states and SCCs constitutes a formidable challenge. We consider the problem of computingthe set of states in SCCs or terminal SCCs in an asynchronous system. We employ the idea of saturation, which has shown clear advantages in symbolic state-space exploration (Ciardo et al. in Softw Tools Technol Transf 8(1):4-25, 2006;Zhao and Ciardo in Proceedings of 7thinternationalsymposium on automated technology for verification and analysis, pp 368-381, 2009), to improve two previously proposed approaches. We use saturation to speed up state exploration when computing each SCC in the XieBeerel algorithm, and we compute the transitive closure of the transition relation using a novel algorithm based on saturation. Furthermore, we show that the techniques we developed are also applicable to the computation of fair cycles. Experimental results indicate that the improved algorithms using saturation achieve a substantial speedup over previous BFS algorithms. In particular, withthe new transitive closure computation algorithm, up to 10150 SCCs can be explored within a few seconds.
this paper reviews the basics of Software Transactional Memory (STM) algorithms, examines some of their properties, and briefly discusses a collection of impossibility and possibility results in STM computing. the mat...
详细信息
ISBN:
(纸本)9781538626276
this paper reviews the basics of Software Transactional Memory (STM) algorithms, examines some of their properties, and briefly discusses a collection of impossibility and possibility results in STM computing. the material presented in this paper summarizes the main points of the talk that the author delivered in the 19thinternationalsymposium on symbolic and numericalgorithms for scientificcomputing (SYNASC 2017) as an invited speaker through the ACM Distinguished Speakers Programme.
A new psychological model for efficient data transmission in mobile networks under communication constrains is proposed. It accounts for user personality characteristics to determine the feasible path for packet trans...
详细信息
暂无评论