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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Johnson, T., Davis, T., Hadfield, S.: A Concurrent Dynamic Task Graph. Parallel Computing, Vol 22, No 2, Ferbruary 1996, 327–333
Singh, J.P., Weber W-D., Gupta, A.: SPLASH: Stanford Parallel Applications for Shared Memory. Computer Architecture News, 20(1), July 1994, 5–44
Chandra, R., Gupta, A., Hennessy, L.: Integrating Concurency and Data Abstraction in the COOL Parallel Programming Language. IEEE Computer, February 1994
Rost, J., Markus, F.-J., Li Yan-Hua: “Agency Scheduling” A Model for Dynamic Task Scheduling. Proc of the Int. Conf. on Parallel Processing pmEuro-Par 95, Sweden
Nikhil, R.S., Papadopoulos, G.M., Arvind: *T: A Multithreaded Massively Parallel Architecture. Int. Symp. on Computer Architecture, 1992, 156–167
Stanford Compiler Group: The SUIF Library. Stanford University 1994
Smith, M.D.: The SUIF Machine Library. Harvard University 1997
Woo, S.C., Ohara, M., Torrie, E., Singh, J.P., Gupta, A.: The SPLASH-2 Programs: Characterization and Methodological Considerations. Proc. of the 22nd Ann. Symp. on Computer Architecture, June 1995, 24–36
Gilmont, T., Verians, X., Legat J-D., Veraart, Cl.: Resolution Reduction by Growth of Zones for Visual Prosthesis. Int. Conf. on Image Processing, 1996, 299–302
Shirazi, B., Wang, M.: Analysis and Evaluation of Heuristic Methods for Static Task Scheduling. J. of Parallel and Distributed Computing, vol. 10, 1990, 222–232
Park, G.-L., Shirazi, B., Marquis J., Choo, H.: Decisive Path Scheduling: A New List Scheduling Method. Proc. of the Int. Conf. on Parallel Processing, 1997, 472–480
Dandamudi, S. P., Cheng, P.S.: A Hierarchical Task Queue Organization for Shared-Memory Multiprocessor Systems. IEEE Transaction on Parallel and Distributed Systems, vol. 6, no. 1, January 1995, 1–16
Hamidzadeh, B., Lilja, D.J.: Dynamic Scheduling Strategies for Shared-Memory Multiprocessors. Proc. of the 16th Int. Conf. on Distributed Computing Systems, Hong Kong, 1996, 208–215
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Verians, X., Legat, JD., Quisquater, JJ., Macq, B. (1999). A New Parallelism Management Scheme for Multiprocessor Systems. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_23
Download citation
DOI: https://doi.org/10.1007/3-540-49164-3_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65641-8
Online ISBN: 978-3-540-49164-4
eBook Packages: Springer Book Archive