Heuristics for scheduling parameter sweep applications in grid environments

By Henri Casanova, Arnaud Legrand, Dmitrii Zagorodnov, Francine Berman. Heterogeneous Computing Workshop, 2000

695 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Hardware and Architecture

View Paper: https://www.semanticscholar.org/paper/fe019938b10fead8351214685be6c73f4efa9c5c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Hardware and Architecture

Citations in the corpus

Scheduling Algorithms for Grid Computing: State of the Art and Open Problems (2006, methodology): “Examples of such applications include parameter sweep applications [22] [23] [60], and data stripe processing [11] [100].”
Mapping Abstract Complex Workflows onto Grid Environments (2003, background): “Some schedulers have focused on parameter sweep applications, where a single application is run multiple times with different parameters [12].”
Cloud auto-scaling with deadline and budget constraints (2010, background): “They are just-in-time scheduling (fully dynamic approach) [43], full-ahead planning (fully static approach) [44][45] and hybrid scheduling [46][47].”
QoS guided Min-Min heuristic for grid task scheduling (2003, methodology): “An extended suffrage heuristic was presented in [9] for scheduling parameter sweep applications based on the AppLeS [lsl framework that takes the advantage of file sharing to achieve better performance under a wide variety of load conditions.”
The AppLeS Parameter Sweep Template: User-Level Middleware for the Grid (2000, methodology): “All the heuristics mentioned here have been evaluated in simulation environments and XSufferage proved to be the most promising heuristic (see [27]).”
Scheduling distributed applications: the SimGrid simulation framework (2003, methodology): “SimGrid has already been used for a number of successful research endeavors [10, 41, 18, 43, 3, 4, 47] in our groups, and the SimGrid user community is currently undergoing a dramatic expansion.”
Adaptive Computing on the Grid Using AppLeS (2003, background): “We found that XSufferage outperforms competing heuristics on average and that, in general, list-scheduling outperforms self-scheduling for an application such as MCell (see [34]).”
New Grid Scheduling and Rescheduling Methods in the GrADS Project (2004, methodology): “heuristics that we apply are the min-min, the max-min, and the sufferage heuristics [3, 19].”