Analysis and evaluation of heuristic methods for static task scheduling
Journal of Parallel and Distributed Computing
SPLASH: Stanford parallel applications for shared-memory
ACM SIGARCH Computer Architecture News
T: a multithreaded massively parallel architecture
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
The SPLASH-2 programs: characterization and methodological considerations
ISCA '95 Proceedings of the 22nd annual international symposium on Computer architecture
A concurrent dynamic task graph
Parallel Computing
Decisive Path Scheduling: A New List Scheduling Method
ICPP '97 Proceedings of the international Conference on Parallel Processing
"Agency Scheduling" A Model for Dynamic Task Scheduling
Euro-Par '95 Proceedings of the First International Euro-Par Conference on Parallel Processing
Dynamic scheduling strategies for shared-memory multiprocessors
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
A Graph-Oriented Task Manager for Small Multiprocessor Systems
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
| Hi-index | 0.00 |
Current multimedia and signal processing applications become more complex. This paper proposes a new parallelism management scheme that can explicitly deal with complex and general parallelism patterns. The parallelism description is based on a task flow graph representation interlaced with control commands. A graph management algorithm is proposed to extract eligible tasks and implement synchronization operations. We show that this management outperforms classical parallelism extraction in case of complex applications. Moreover, the parallelism description can be directly inserted in sequential programs without deep code modifications.