Journal Article10.1109/71.506702
Runtime incremental parallel scheduling (RIPS) on distributed memory computers
Wei Shu,Min-You Wu +1 more
35
TL;DR: The paper presents methods for scheduling a single job on a dedicated parallel machine using the advanced parallel scheduling technique to produce a low overhead, high quality load balancing, as well as adapting to irregular applications.
read more
Abstract: Runtime Incremental Parallel Scheduling (RIPS) is an alternative strategy to the commonly used dynamic scheduling. In this scheduling strategy, the system scheduling activity alternates with the underlying computation work. RIPS utilizes the advanced parallel scheduling technique to produce a low overhead, high quality load balancing, as well as adapting to irregular applications. The paper presents methods for scheduling a single job on a dedicated parallel machine.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Simgrid: a toolkit for the simulation of application scheduling
Henri Casanova
- 15 May 2001
TL;DR: This work presents Simgrid a simulation toolkit for the study of scheduling algorithms for distributed application, giving the main concepts and models behind Simgrid, its API and current implementation issues, and describes work that builds on Simgrid's functionalities.
492
A tenant-based resource allocation model for scaling Software-as-a-Service applications over cloud computing infrastructures
Javier Espadas,Arturo Molina,Guillermo Jimenez,Martin Molina,Raúl Antonio Trejo Ramírez,David Concha +5 more
TL;DR: This work attempts to establish formal measurements for under and over provisioning of virtualized resources in cloud infrastructures, specifically for SaaS platform deployments and proposes a resource allocation model to deploy SAAS applications over cloud computing platforms by taking into account their multi-tenancy, thus creating a cost-effective scalable environment.
262
On runtime parallel scheduling for processor load balancing
TL;DR: Scheduling algorithms for tree, hypercube, and mesh networks are presented that can fully balance the load and maximize locality at runtime and are significantly reduced compared to other existing algorithms.
66
Scheduling for large-scale parallel video servers
Min-You Wu,Wei Shu +1 more
- 27 Mar 1996
TL;DR: Optimal algorithms are presented for conflict-free scheduling, delay minimization, load balancing, and admission control in parallel video servers for large-scale video-on-demand systems.
27
The hybrid dynamic parallel scheduling algorithm for load balancing on Chained-Cubic Tree interconnection networks
TL;DR: The proposed algorithm, which is called Hybrid Dynamic Parallel Scheduling Algorithm (HD-PSA), is a combination of two common load balancing strategies; dynamic load balancing and parallel scheduling.
23
References
Depth-first iterative-deepening: an optimal admissible tree search
TL;DR: This heuristic depth-first iterative-deepening algorithm is the only known algorithm that is capable of finding optimal solutions to randomly generated instances of the Fifteen Puzzle within practical resource limits.
1.7K
•Book
Solving Problems on Concurrent Processors
Geoffrey C. Fox
- 01 Mar 1988
TL;DR: Self steering systems for marine craft are described which comprise wind direction sensing and course setting means, servo rudder means operatively connected to a rudder and connecting means linking the servo rubber means to the wind sensing andcourse setting means.
1.3K
Dynamic load balancing for distributed memory multiprocessors
TL;DR: This paper completely analyze the hypercube network by explicitly computing the eigenstructure of its node adjacency matrix and shows that a diffusion approach to load balancing on a hypercube multiprocessor is inferior to another approach which is called the dimension exchange method.
1.1K
Depth-first iterative-deepening: an optimal admissible tree search
TL;DR: A depth·first iterative·deepening algorithm is shown to be asymptotically optimal along all three dimmsions for exponential tree searches and is the only known algorithm that is capable of finding optimal solUtions to randomly generated instances of the Fif/un Puzzle within practical resource.
A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures
G.C. Sih,Edward A. Lee +1 more
TL;DR: The authors present a compile-time scheduling heuristic called dynamic level scheduling, which accounts for interprocessor communication overhead when mapping precedence-constrained, communicating tasks onto heterogeneous processor architectures with limited or possibly irregular interconnection structures.
951