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
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
A New Parallelism Management Scheme for Multiprocessor Systems
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
Dynamic scheduling strategies for shared-memory multiprocessors
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
| Hi-index | 0.00 |
A task manager that dynamically decodes the data-dependent task graph is a key component of general multiprocessor systems. The emergence of small-scale parallel systems for multimedia and general-purpose applications requires the extraction of complex parallelism patterns. The small system size also allows the centralization of the task generation and synchronization. This paper proposes such a task manager. It uses a structured representation of the task dependence graph to issue and synchronize tasks. We describe several optimizations to extract more parallelism, discuss the software/hardware implementation issue and show it produces efficient parallelism exploitation in case of applications with complex parallelism patterns.