Overview of a performance evaluation system for global computing scheduling algorithms

Takefusa, Atsuko; Matsuoka, Satoshi; Nakada, Hidemoto; Aida, Kô; Nagashima, Umpei

doi:10.1109/hpdc.1999.805287

Cited by 75 publications

(54 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Bricks [23] is designed for simulations of client-server architectures in Grids, SimGrid [18] is used for the simulation and development of distributed applications in heterogeneous and distributed environment. Simbatch [10] allows to evaluate scheduling algorithms for batch schedulers and MicroGrid [19] can be used for systematic study of the dynamic behavior of applications, middleware, resources, and networks.…”

Section: Characteristics Of the Alea Simulatormentioning

confidence: 99%

Alea – Grid Scheduling Simulation Environment

Klusáček

Matyska

Rudová

Parallel Processing and Applied Mathematics

View full text Add to dashboard Cite

Abstract. This work concentrates on the design of a system intended for study of advanced scheduling techniques for planning various types of jobs in a Grid environment. The solution is able to deal with common problems of the job scheduling in Grids like heterogeneity of jobs and resources, and dynamic runtime changes such as arrivals of new jobs. Our new simulator called Alea is based on the GridSim simulation toolkit which we extended to provide a simulation environment that supports simulation of varying Grid scheduling problems. To demonstrate the features of the GridSim environment, we implemented an experimental centralised Grid scheduler which uses advanced scheduling techniques for schedule generation. By now local search based algorithms and some dispatching rules were tested. The scheduler is capable to handle both static and dynamic situation. In the static case, all jobs are known in advance while the dynamic situation means that jobs appear in the system during simulation. In this case generated schedule is changing through time as some jobs are already finished while the new ones are arriving. Comparison of FCFS, local search and dispatching rules is presented for both cases and we demonstrate that the new local search based algorithm provides the best schedule while keeping the running time acceptable.

show abstract

Section: Characteristics Of the Alea Simulatormentioning

confidence: 99%

Alea – Grid Scheduling Simulation Environment

Klusáček

Matyska

Rudová

Parallel Processing and Applied Mathematics

View full text Add to dashboard Cite

show abstract

“…We have demonstrated in previous work [37] that it is easy to "plug in" various external components into the Scheduling Unit (e.g. predictor from the Network Weather Service [39]).…”

Section: The Bricks System and The Extensionmentioning

confidence: 99%

“…predictor from the Network Weather Service [39]). We refer the reader to [3,37] for evaluation and validation results concerning Bricks.…”

Section: The Bricks System and The Extensionmentioning

confidence: 99%

“…CPU load) are modeled after traces (vectors of time-stamps values). Typically, those traces come from measurements on real resources [37] (e.g. with the NWS [39]).…”

Section: Simulation Of Background Loadmentioning

confidence: 99%

“…As a first step towards deriving an effective scheduling algorithm that satisfies such a requirement, we propose a simple deadline scheduling strategy for NES systems. We propose various parametrizations and strategies that we conjecture would improve the overall scheduling results, and use the Bricks simulation framework [37,3,9] for evaluation purposes.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A study of deadline scheduling for client-server systems on the Computational Grid

Takefusa

Casanova

Matsuoka

et al.

Proceedings 10th IEEE International Symposium on High Performance Distributed Computing

Self Cite

View full text Add to dashboard Cite

show abstract

Parameter Sweeps on the Grid with APST

Casanova

Berman

2003

Grid Computing

View full text Add to dashboard Cite

Parameter sweep applications consist of large sets of independent tasks and arise in many fields of science and engineering. Due to their flexible task synchronization requirements, these applications are ideally suited to large-scale distributed platforms such as the Computational Grid. However, for users to readily benefit from such platforms, it is necessary to provide transparent application deployment and automatic application scheduling. We present here version 2.0 of the AppLeS Parameter Sweep Template (APST) software, an application execution environment which schedules and deploys large-scale parameter sweep applications on Grid platforms. We describe the main principles behind the design of APST, its current implementation, and the services and mechanisms it can leverage to deploy applications. We illustrate APST's usability and explain how its XML-based interface allows users to easily direct Grid resources to run their applications. Finally, we briefly discuss applications that are currently using APST, and we highlight future developments.

show abstract

Overview of a performance evaluation system for global computing scheduling algorithms

Abstract: Abstract

Cited by 75 publications

References 9 publications

Alea – Grid Scheduling Simulation Environment

Alea – Grid Scheduling Simulation Environment

A study of deadline scheduling for client-server systems on the Computational Grid

Parameter Sweeps on the Grid with APST

Contact Info

Product

Resources

About