There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efficient utilization of network resource...
详细信息
There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efficient utilization of network resources and extensibility of information servers. This paper presents a scheduling scheme for allocating resources to a mix of real-time and non real-time mobile programs. Within this framework, both mobile programs and hosts can specify constraints on how CPU should be allocated. On the basis of the constraints, the scheme constructs a scheduling graph on which it applies several scheduling algorithms. In case of conflicts between mobile program and host specified constraints, the schemes implement a policy that resolves the conflicts in favor of the host. The resulting scheduling scheme is adaptive, flexible, and enforces both program and host specified constraints.
A new approach to develop parallel and distributed algorithms of scheduling tasks in parallel computers is proposed. A game theoretical model with the use of genetic-algorithms based learning machines called classifie...
详细信息
A new approach to develop parallel and distributed algorithms of scheduling tasks in parallel computers is proposed. A game theoretical model with the use of genetic-algorithms based learning machines called classifier systems as players in a game, serves as a theoretical framework of the approach. Experimental study of such a system shows its self-organizing features and the ability of collective behaviour. Following this approach a parallel and distributed scheduler is described. A simple version of the proposed scheduler has been implemented. Results of the experimental study of the scheduler demonstrate its high performance. (C) 1998 Elsevier Science B.V. All rights reserved.
We investigate coordination issues in a distributed job-shop scheduling system in which agents schedule potentially contentious activities asynchronously in parallel. Agents in such a system will in general have a lim...
详细信息
ISBN:
(纸本)081868500X
We investigate coordination issues in a distributed job-shop scheduling system in which agents schedule potentially contentious activities asynchronously in parallel. Agents in such a system will in general have a limited view of the global state of resources and must exchange appropriate state information with other agents in order to schedule effectively. However even given perfect instantaneous knowledge of other agents' resource requirements, agents still may not be able to schedule effectively if they do not also model the possible future actions of other agents and the effects of their own actions. We formally describe two types of agent behaviors, poaching and distraction, arising from the asynchronous nature of distributedsystems that decrease scheduling effectiveness, and we present experimental results from a distributed airport resourcemanagement system demonstrating a significant improvement in scheduling performance when coordination mechanisms are used to prevent such behaviors.
The proceedings contain 18 papers. The topics discussed include: schedulingresources in multi-user, heterogeneous, computing environments with SmartNet;the Globus project: a status report;Netsolve: a network-enabled ...
ISBN:
(纸本)0818683651
The proceedings contain 18 papers. The topics discussed include: schedulingresources in multi-user, heterogeneous, computing environments with SmartNet;the Globus project: a status report;Netsolve: a network-enabled solver;examples and users;implementing distributed synthetic forces simulations in metacomputing environments;CCS resourcemanagement in networked HPC systems;a dynamic matching and scheduling algorithm for heterogeneous computing systems;dynamic, competitive scheduling of multiple DAGS in a distributed heterogeneous environment;the relative performance of various mapping algorithms is independent of sizable variances in run-time predictions;modeling the slowdown of data-parallel applications in homogeneous and heterogeneous clusters of workstations;specification and control of cooperative work in a heterogeneous computing environment;a mathematical model, heuristic, and simulation study for a basic data staging problem in a heterogeneous networking environment;modular heterogeneous system development: a critical analysis of java;fault-tolerance: Java's missing buzzword;heterogeneous parallel computing with Java: jabber or justified?;on the interaction between mobile processes and objects;steps toward understanding performance in Java;and heterogeneous programming with Java: gourmet blend or just a hill of beans?.
We consider the problem of efficiently executing a set of parallel jobs on a parallel machine by effectively scheduling the jobs on the computer's resources. This problem is one of optimization of resource utiliza...
详细信息
ISBN:
(纸本)3540649522
We consider the problem of efficiently executing a set of parallel jobs on a parallel machine by effectively scheduling the jobs on the computer's resources. This problem is one of optimization of resource utilization by parallel computing programs and/or the management of multi-users requests on a distributed system. We assume that each job is parallelizable and can be executed on any number of processors. Various on-line scheduling strategies of time/space sharing are presented here. The goal is to assign jobs to processors in space and time such that the total execution time is optimized.
Metacomputing systems are intended to support remote and/or concurrent use of geographically distributed computational resources. resourcemanagement in such systems is complicated by five concerns that do not typical...
详细信息
Advances in networking infrastructure have made it possible to build very large scale applications whose execution spans multiple supercomputers. In such very large scale or ultra-scale applications, a central require...
详细信息
ISBN:
(纸本)3540654143
Advances in networking infrastructure have made it possible to build very large scale applications whose execution spans multiple supercomputers. In such very large scale or ultra-scale applications, a central requirement is the ability to simultaneously co-allocate large collections of resources, to initiate a computation on those resources and to initialize the distributed collection of components to construct a single, integrated computation. In a previous paper [3], we defined a general resourcemanagement architecture for high-performance distributedsystems in which resource co-allocation was an integral component. In this extended abstract, we examine co-allocation in more detail and describe the implementation of a specific resource co-allocator called the Dynamically Updated Request Online Co-allocator, or DUROC. DUROC has been implemented as part of the Globus grid toolkit. We briefly describe the design of DUROC and discuss how is has been used to support a range of large-scale grid applications.
The Enhanced Pay-Per-View (EPPV) service model provides an effective way of delivering continuous media (CM) data clips to a large number of different clients. The aim is to share CM streams among various clients, the...
详细信息
The Enhanced Pay-Per-View (EPPV) service model provides an effective way of delivering continuous media (CM) data clips to a large number of different clients. The aim is to share CM streams among various clients, thereby increasing the level of concurrency beyond the capacity limitations of available resources (e.g., disk bandwidth, RAM, and network bandwidth), while guaranteeing an upper bound on the clients' waiting time. In the EPPV service model, waiting time guarantees are provided by means of a regular playback schedule, where each continuous media clip is displayed periodically with a frequency that depends on factors such as the clip's popularity. Efficiency is achieved by sharing these periodic CM streams among multiple clients. The EPPV model offers a number of advantages over other schemes (e.g., batching), which makes it more attractive to large-scale service providers. The purpose of this paper is twofold: (1) to provide an overview of our recent results on the resourcescheduling problems associated with supporting EPPV for continuous media clips with (possibly) different display rates, frequencies, and lengths;and, (2) to outline a number of open research problems related to the EPPV service model. A major contribution of our work is the introduction of a robust scheduling framework that, we believe, can provide solutions for a variety of realistic EPPV resourcescheduling scenarios, as well as any scheduling problem involving regular, periodic use of a shared resource. Based on this framework, we propose various interesting research directions for extending the results presented in this paper.
The proceedings contain 16 papers. The topics discussed include: Internet packet loss: measurement and implications for end-to-end QoS;on the design of network routers for multimedia applications;the impact of smart d...
ISBN:
(纸本)0818686588
The proceedings contain 16 papers. The topics discussed include: Internet packet loss: measurement and implications for end-to-end QoS;on the design of network routers for multimedia applications;the impact of smart disks and spatial reuse property on RAID-5 storage systems;experiences with software MPEG-2 video decompression on an SMP PC;analyzing cache performance for video servers;performance evaluation of the stony brook video server;communication scheduling in a distributed memory parallel interactive continuous media server system;optimising the file allocation of parallel web server online using access patterns;cooperation protocols for multimedia communication network based on ADIPS framework;ADIPS framework and it's application to symbiotic space on network environment;compressed video transmission protocol considering dynamic QoS control;flexible wide-area group communication protocols - international experiments;algebraic modelling of an ad hoc network for mobile computing;adaptive distributed dynamic channel allocation for wireless networks;distributed object models, mobile computing and electronic commerce;and protected resource access for mobile agent-based distributed computing.
The proceedings contain 14 papers. The special focus in this conference is on Predictability Issues and On Practical Experience of Active, Real-Time, and Temporal Database systems. The topics include: Real-time and ac...
ISBN:
(纸本)3540656499
The proceedings contain 14 papers. The special focus in this conference is on Predictability Issues and On Practical Experience of Active, Real-Time, and Temporal Database systems. The topics include: Real-time and active databases;design of a real-time SQL engine in the distributed environment;a cellular database system for the 21st century;global multimedia database support for dependable, real-time applications;an active real-time database model for air traffic control systems;performance issues in processing active real-time transactions;scheduling of triggered transactions in distributed real-time active databases;buffer management in active, real-time database systems;parallel event detection in active database systems: the heart of the matter;toward duration-based, constrained and dynamic event types;supporting system-level testing of applications by active real-time database systems;temporal indeterminacy in deductive databases: an approach based on event calculus;predictability in active real-time/temporal databases chair and practical and industrial experience in active real-time databases.
暂无评论