Sequencing and scheduling: Algorithms and complexity
EL Lawler, JK Lenstra, AHGR Kan… - Handbooks in operations …, 1993 - Elsevier
Publisher Summary This chapter discusses different types of sequencing and scheduling
problems, and describes different types of algorithms and the concepts of complexity theory …
problems, and describes different types of algorithms and the concepts of complexity theory …
Static scheduling algorithms for allocating directed task graphs to multiprocessors
Static scheduling of a program represented by a directed task graph on a multiprocessor
system to minimize the program completion time is a well-known problem in parallel …
system to minimize the program completion time is a well-known problem in parallel …
A bridging model for parallel computation
LG Valiant - Communications of the ACM, 1990 - dl.acm.org
The success of the von Neumann model of sequential computation is attributable to the fact
that it is an efficient bridge between software and hardware: high-level languages can be …
that it is an efficient bridge between software and hardware: high-level languages can be …
LogP: Towards a realistic model of parallel computation
A vast body of theoretical research has focused either on overly simplistic models of parallel
computation, notably the PRAM, or overly specific models that have few representatives in …
computation, notably the PRAM, or overly specific models that have few representatives in …
Workflow scheduling in cloud: a survey
To program in distributed computing environments such as grids and clouds, workflow is
adopted as an attractive paradigm for its powerful ability in expressing a wide range of …
adopted as an attractive paradigm for its powerful ability in expressing a wide range of …
[كتاب][B] Parallel programming
T Rauber, G Rünger - 2013 - Springer
Innovations in hardware architecture, such as hyper-threading or multicore processors,
make parallel computing resources available for computer systems in different areas …
make parallel computing resources available for computer systems in different areas …
Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors
In this paper, we propose a static scheduling algorithm for allocating task graphs to fully
connected multiprocessors. We discuss six recently reported scheduling algorithms and …
connected multiprocessors. We discuss six recently reported scheduling algorithms and …
LogGP: Incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation
A Alexandrov, MF Ionescu, KE Schauser… - Proceedings of the …, 1995 - dl.acm.org
We present a new model of parallel computation—the LogGP model—and use it to analyze
a number of algorithms, most notably, the single node scatter (one-to-all personalized …
a number of algorithms, most notably, the single node scatter (one-to-all personalized …
DSC: Scheduling parallel tasks on an unbounded number of processors
We present a low-complexity heuristic, named the dominant sequence clustering algorithm
(DSC), for scheduling parallel tasks on an unbounded number of completely connected …
(DSC), for scheduling parallel tasks on an unbounded number of completely connected …
[كتاب][B] Embedded multiprocessors: Scheduling and synchronization
S Sriram, SS Bhattacharyya - 2018 - taylorfrancis.com
Techniques for Optimizing Multiprocessor Implementations of Signal Processing
Applications An indispensable component of the information age, signal processing is …
Applications An indispensable component of the information age, signal processing is …