STAPL Scheduler | Algorithms & Applications Group

Algorithms & Applications Group
STAPL Scheduler

supported by NSF, DOE
Olga Pearce, Marvin Adams, Nancy Amato
Project Alumni: Ping An

Task Scheduling | Scheduling Algorithms | STAPL Scheduler | ASCI Scheduler

Standard Template Adaptive Parallel Library (STAPL) is a parallel version of Standard Template Library (STL) for C++.

STAPL components

Task Scheduling is important for the performance of applying STAPL in various applications. STAPL Scheduler is responsible of mapping tasks onto multiple processors to gain the maximum performance out of the system. The STAPL scheduler should also provide an interface for the user to have control of the scheduling process. The scheduling strategy can be internally selected, or the user can select a specific way, like wave front execution, or ultimately provide their own scheduling strategies for their best interests. The scheduling results are passed to the STAPL Executor. The Executor is responsible for the real dispatching and execution of the problem.

One of the applications of STAPL is the ASCI project. Due to the specific requirement of physical computation, we develop a scheduling package, ASCI Scheduler, which uses the STAPL scheduler in its construction and is an example of a user-defined scheduler. The following pages present a short introduction to task scheduling problems, and some algorithms used in STAPL Scheduler.

Related Projects

Task Scheduling
Scheduling Algorithms
ASCI Scheduler

Papers

Task Scheduling and Parallel Mesh-Sweeps in Transport Computations, Nancy M. Amato, Ping An, Technical Report, TR00-009, Department of Computer Science, Texas A&M University, Jan 2000.
Technical Report(ps, pdf)

Department of Computer Science | Dwight Look College of Engineering | Texas A&M University
Privacy statement: Computer Science Engineering TAMU