Logo des Repositoriums

Auflistung nach Schlagwort "Schedule Algorithm"

1 - 3 von 3
  • Zeitschriftenartikel
    A highly configurable and efficient simulator for job schedulers on supercomputers
    (PARS: Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware: Vol. 30, No. 1, 2013) Karbach, Carsten
    The supercomputers maintained by the J¨ ulich Supercomputing Centre (JSC) are run in batch mode and are shared among all active users. Jobs are submitted to the job scheduler, which determines for each job the time of execution. It manages running and waiting jobs, sorts them by a given priority and executes the jobs by fitting them into the current system state. For users it is often difficult to comprehend the job scheduler's algorithm. Thus, a prediction of the future system allocation of currently running and queued jobs is valuable. It helps users to plan job submissions and supports administrators by optimising the system load. This paper summarises the design and implementation of a configurable simulation for various job schedulers. The developed simulation program called JuFo focuses on the job schedulers Loadleveler and Moab as these are the most important batch systems for the supercomputers provided by the JSC. A major design goal is to keep the simulation independent from special job schedulers, which is achieved by the generic configuration of JuFo. Finally, a test framework is developed, which allows for evaluating the accuracy of the generated schedules.
  • Zeitschriftenartikel
    Peelsched: a Simple and Parallel Scheduling Algorithm for Static Taskgraphs
    (PARS: Parallel-Algorithmen, -Rechnerstrukturen und -Systemsoftware: Vol. 28, No. 1, 2011) Keller, Jörg; Gerhards, Rainer
    We present a new algorithm, which we call P EELSCHED, to schedule a set of tasks with precedence constraints and communication costs onto a parallel computer with homogeneous processing units. The algorithm is deterministic and simple, and can be parallelized itself. The new algorithm is based on the usage of structural graph properties, in particular series-parallel or N-free graphs, but can be used on any DAG. We provide an implementation and validate it against a benchmark suite of task graphs. We find that the algorithm's scheduling results are comparable to strictly sequential schedulers.
  • Zeitschriftenartikel
    Petri Net Analysis of Non-Redundant and Redundant Execution Schemes
    (FERS-Mitteilungen: Vol. 28, No. 1, 2010) Einer, Stefan; Fechner, Bernhard; Keller, Jörg
    Stefan Einer, Schweizerische Bundesbahnen, 3000 Bern, Switzerland, stefan.einer@sbb.ch Bernhard Fechner, FernUniversität in Hagen, 58084 Hagen, Germany, bernhard.fechner@fernuni-hagen.de Jörg Keller, FernUniversität in Hagen, 58084 Hagen, Germany, joerg.keller@fernuni-hagen.de