A new parallelism management scheme for multiprocessor systems

Verians, X;Legat, Jean-Didier;Quisquater, Jean-Jacques;Macq, Benoît
(1999) 4th International Austrian-Center-for-Parallel-Computation Conference — Location: SALZBURG(Austria) (16.February.1999)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 441.45 KB
Request a copy

Details

Authors
Abstract
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.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Verians, X., Legat, J.-D., Quisquater, J.-J., & Macq, B. (1999). A new parallelism management scheme for multiprocessor systems. Lecture Notes in Computer Science, 1557, 246-256. https://doi.org/10.1007/3-540-49164-3_23 (Original work published 1999)