Academic
Publications
Partitioning and scheduling parallel programs for multiprocessing

Partitioning and scheduling parallel programs for multiprocessing,Vivek Sarkar

Partitioning and scheduling parallel programs for multiprocessing   (Citations: 346)
BibTex | RIS | RefWorks Download
This book present two approaches to automatic partitioning and scheduling to execute the same parallel program efficiently on widely different multiprocessors. Both the first approach (based on a macrodata flow model) and the second approach (based on a compile-time scheduling model) have been implemented in partition programs written in the single-assignment language SISAL and both are described.
Published in 1989.
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...There is also research on identifying parallelism in sequential programs (e.g., Bokhariet [13], Sarkar [14, 15], Yang and Gerasoulis [16])...

    Yitao Niet al. Detecting Concurrency-Related Problematic Activity Arrangement in WS-B...

    • ...onto a multiprocessor system has been shown to be NP-Complete in general [31] and various heuristic algorithms have been proposed in the literature to reduce the complexity [32]‐[34], but their objective is to minimize the total completion time of the task set, rather than guaranteeing timing constraints under temporal isolation...
    • ...Another technique, called Critical Path Heuristics [31], [34], was developed to deal with non-negligible communication delays between tasks...

    Giorgio Buttazzoet al. Partitioning Real-Time Applications Over Multicore Reservations

    • ...uling algorithms whose asymptotic complexity increase with the number of edges in the graph [6]‐[9]...

    Per Larsenet al. Expressing Coarse-Grain Dependencies Among Tasks in Shared Memory Prog...

    • ... the problem; e.g., Highest Level First with Estimated Times (HLFET) [12], Coffmann-Graham Algorithm [7], CP/MISF [15], Extended List Scheduling (ELS) [13], Mapping Heuristic (MH) [8], Modified Critical Path (MCP) scheduling [23], Dynamic Level Scheduling (DLS) [19], Mobility-Directed Scheduling (MD) [23], fast assignment using search technique (FAST) [16], Generalized List Scheduling (GLS) [3], Sarkar’s Internalization Algorithm [18], ...
    • ... Algorithm [7], CP/MISF [15], Extended List Scheduling (ELS) [13], Mapping Heuristic (MH) [8], Modified Critical Path (MCP) scheduling [23], Dynamic Level Scheduling (DLS) [19], Mobility-Directed Scheduling (MD) [23], fast assignment using search technique (FAST) [16], Generalized List Scheduling (GLS) [3], Sarkar’s Internalization Algorithm [18], Dominant Sequence Clustering Algorithm (DSC) [24], and others (see [4], [6], [11], [18], for ...

    Satoshi Fujita. A Branch-and-Bound Algorithm for Solving the Multiprocessor Scheduling...

    • ...The computation of the critical path is based on Sarkar [21]...

    Daniel Cordeset al. Automatic parallelization of embedded software using hierarchical task...

Sort by: