A new parallelism management scheme for multiprocessor systems

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Verians, X., Legat, J. D., Quisquater, J. J., & Macq, B. (1999). A new parallelism management scheme for multiprocessor systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1557, pp. 246–256). Springer Verlag. https://doi.org/10.1007/3-540-49164-3_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free