A Preemption-based Meta-scheduling System for Distributed Computing

A Preemption-based Meta-scheduling System for Distributed Computing

Author:

Publisher:

Published: 2003

Total Pages:

ISBN-13:

DOWNLOAD EBOOK

This research aims at designing and building a scheduling framework for distributed computing systems with the primary objectives of providing fast response times to the users, delivering high system throughout and accommodating maximum number of applications into the systems. The author claims that the above mentioned objectives are the most important objectives for scheduling in recent distributed computing systems, especially Grid computing environments. In order to achieve the objectives of the scheduling framework, the scheduler employs arbitration of application-level schedules and preemption of executing jobs under certain conditions. In application-level scheduling, the user develops a schedule for his application using an execution model that simulates the execution behavior of the application. Since application-level scheduling can seriously impede the performance of the system, the scheduling framework developed in this research arbitrates between different application-level schedules corresponding to different applications to provide fair system usage for all applications and balance the interests of different applications. In this sense, the scheduling framework is not a classical scheduling system, but a meta-scheduling system that interacts with the application-level schedulers. Due to the large system dynamics involved in Grid computing systems, the ability to preempt executing jobs becomes a necessity. The meta-scheduler described in this dissertation employs well defined scheduling policies to preempt and migrate executing applications. In order to provide the users with the capability to make their applications preemptible, a user-level checkpointing library called SRS (Stop-Restart Software) was also developed by this research. The SRS library is different from many user-level checkpointing libraries since it allows reconfiguration of applications between migrations. This reconfiguration can be achieved by changing the processor configuration and/or data distribution. The experimental results provided in this dissertation demonstrates the utility of the metascheduling framework for distributed computing systems. And lastly, the metascheduling framework was put to practical use by building a Grid computing system called GradSolve. GradSolve is a flexible system and it allows the application library writers to upload applications with different capabilities into the system. GradSolve is also unique with respect to maintaining traces of the execution of the applications and using the traces for subsequent executions of the application.


Metaheuristics for Scheduling in Distributed Computing Environments

Metaheuristics for Scheduling in Distributed Computing Environments

Author: Fatos Xhafa

Publisher: Springer Science & Business Media

Published: 2008-08-19

Total Pages: 373

ISBN-13: 3540692606

DOWNLOAD EBOOK

This volume presents meta-heuristics approaches for Grid scheduling problems. It brings new ideas, analysis, implementations and evaluation of meta-heuristic techniques for Grid scheduling, which make this volume novel in several aspects.


Meta-scheduling for Distributed Continuous Media

Meta-scheduling for Distributed Continuous Media

Author: University of California, Berkeley. Computer Science Division

Publisher:

Published: 1990

Total Pages: 34

ISBN-13:

DOWNLOAD EBOOK

Next-generation distributed systems will support continuous media (digital audio and video) in the same hardware/software framework as other data. Many applications that use continous media (CM) have end- to-end performance requirements such as minimum throughput or maximum delay. To reliably support these requirements, system components such as CPU schedulers, networks, and file systems must offer realtime semantics. A meta-scheduler coordinates these components, negotiating end-to-end guarantees on behalf of clients. The CM-resource model, described in this paper, provides a basis for such a meta- scheduler. The model defines a workload parameterization, an abstract interface to resources, and an end-to-end algorithm for negotiated reservation of multiple resources, and an end-to-end algorithm for negotiated reservation of multiple resources; the division of delay is based on an economic model. Clients make reservations for worst-case workload and resources offer hard delay bounds. However, system components may "work ahead" within limits, increasing the responsiveness of bursty non-realtime workload.


Advances in Grid Computing

Advances in Grid Computing

Author: Zoran Constantinescu

Publisher: BoD – Books on Demand

Published: 2011-02-28

Total Pages: 287

ISBN-13: 9533073012

DOWNLOAD EBOOK

This book approaches the grid computing with a perspective on the latest achievements in the field, providing an insight into the current research trends and advances, and presenting a large range of innovative research papers. The topics covered in this book include resource and data management, grid architectures and development, and grid-enabled applications. New ideas employing heuristic methods from swarm intelligence or genetic algorithm and quantum encryption are considered in order to explain two main aspects of grid computing: resource management and data management. The book addresses also some aspects of grid computing that regard architecture and development, and includes a diverse range of applications for grid computing, including possible human grid computing system, simulation of the fusion reaction, ubiquitous healthcare service provisioning and complex water systems.


Scheduling and Load Balancing in Parallel and Distributed Systems

Scheduling and Load Balancing in Parallel and Distributed Systems

Author: Behrooz A. Shirazi

Publisher: Wiley-IEEE Computer Society Press

Published: 1995-05-14

Total Pages: 524

ISBN-13:

DOWNLOAD EBOOK

This book focuses on the future directions of the static scheduling and dynamic load balancing methods in parallel and distributed systems. It provides an overview and a detailed discussion of a wide range of topics from theoretical background to practical, state-of-the-art scheduling and load balancing techniques.


Challenges and Directions Forward for Dealing with the Complexity of Future Smart Cyber–Physical Systems

Challenges and Directions Forward for Dealing with the Complexity of Future Smart Cyber–Physical Systems

Author: Martin Törngren

Publisher: MDPI

Published: 2021-02-16

Total Pages: 232

ISBN-13: 3039430203

DOWNLOAD EBOOK

A key aspect of cyber-physical systems (CPS) is their potential for integrating information technologies with embedded control systems and physical systems to form new or improved functionalities. CPS thus draws upon advances in many areas. This positioning provides unprecedented opportunities for innovation, both within and across existing domains. However, at the same time, it is commonly understood that we are already stretching the limits of existing methodologies. In embarking towards CPS with such unprecedented capabilities, it becomes essential to improve our understanding of CPS complexity and how we can deal with it. Complexity has many facets, including complexity of the CPS itself, of the environments in which the CPS acts, and in terms of the organizations and supporting tools that develop, operate, and maintain CPS. This book is a result of a journal Special Issue, with the objective of providing a forum for researchers and practitioners to exchange their latest achievements and to identify critical issues, challenges, opportunities, and future directions for how to deal with the complexity of future CPS. The contributions include 10 papers on the following topics: (I) Systems and Societal Aspects Related to CPS and Their Complexity; (II) Model-Based Development Methods for CPS; (III) CPS Resource Management and Evolving Computing Platforms; and (IV) Architectures for CPS.


Software Engineering and Computer Systems, Part II

Software Engineering and Computer Systems, Part II

Author: Jasni Mohamad Zain

Publisher: Springer Science & Business Media

Published: 2011-06-22

Total Pages: 756

ISBN-13: 3642221904

DOWNLOAD EBOOK

This Three-Volume-Set constitutes the refereed proceedings of the Second International Conference on Software Engineering and Computer Systems, ICSECS 2011, held in Kuantan, Malaysia, in June 2011. The 190 revised full papers presented together with invited papers in the three volumes were carefully reviewed and selected from numerous submissions. The papers are organized in topical sections on software engineering; network; bioinformatics and e-health; biometrics technologies; Web engineering; neural network; parallel and distributed e-learning; ontology; image processing; information and data management; engineering; software security; graphics and multimedia; databases; algorithms; signal processing; software design/testing; e- technology; ad hoc networks; social networks; software process modeling; miscellaneous topics in software engineering and computer systems.


A High Performance Dynamic Meta-scheduler with Migration Support for Grid Applications

A High Performance Dynamic Meta-scheduler with Migration Support for Grid Applications

Author: Gamal El-Sayed

Publisher:

Published: 2007

Total Pages:

ISBN-13:

DOWNLOAD EBOOK

A central issue in Grid computing is the fact that resources (compute and communication fabrics) may vary over time, and thus scheduling decisions made by super (meta) schedulers may be pre-empted locally in response to a number of local conditions. Current superschedulers/scheduling schemes (such as AppLeS) develop essentially static schedules which are non-responsive to fabric dynamicism, and thus a task set scheduled by typical superschedulers is largely incapable of taking advantage of dynamic enhancements to the fabric or (worse) to pre-emption by an aggressive local scheduling decision. In the worst case, such pre-emption can result in premature termination of a task set. We present a novel superscheduling schema based on the widely-popular AppLeS and Globus Grid middleware which addresses the issue of dynamic rescheduling of Grid applications when an a priori schedule is challenged locally within the fabric. Specifically, we are concerned with the difficult problem of migrating dependent task sets robustly. We explore the use of non-blocking coordinated checkpointing and demonstrate that, subject to certain conditions, dependent task sets may be migrated robustly. Additionally, we show how AppLeS can be extended to function as a high-performance superscheduler i.e., as a superscheduler concerned with group performance rather than individual application performance. Finally, we demonstrate certain performance characteristics of the scheme using a Grid simulation tool developed at the University of Connecticut.