Abstract
One way to obtain higher computational performance of a computer H is to use a parallel coprocessor unit C which is attached to H and can efficiently solve computationally demanding applications. If such a unit C can be used for concurrent execution of several independent executable programs, the problem of efficient run-time (i.e. dynamic) allocation of programs to C arises. Our aim is to find an allocation strategy that maximizes throughput of the overall system H-C.
We present two dynamic allocation approaches for C with mesh-connected architecture. In both cases we reduce the allocation problem to the weighted bipartite matching problem which must be solved during the run-time each time a set of waiting executable programs is to be allocated space in C. The two approaches differ in the way they search for free space in C.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Kvas, A., Ojsteršek, M., Žumer, V.: Evaluation of static program allocation schemes for macro data-flow computers. Proc. EUROMICRO 94 (1994) 573–580
Li, K., Cheng, K.H.: Job scheduling in partitionable mesh connected systems. ICPP 89 (1989) II.65–72
Mendelson, B., Koren, I.: Using simulated annealing for mapping algorithms onto data driven arrays. Proc. ICPP 91 (1991) I.123–127
Robič, B., Kolbezen, P., Šilc, J.: Area optimization of dataflow-graph mappings. Parallel Comput. 18 (1992) 297–311
Robič, B., Šilc, J.: Fault-tolerant mapping onto VLSI/WSI processor arrays. Proc. EUROMICRO 94 (1994) 697–703
Sérot, J., Quénot, G., Zavidovique, B.: A functional data-flow architecture dedicated to real-time image processing. IFIP Trans. A-23 (1993) 129–140
Trobec, R., Jerebic, I.: Optimization of diagnostic examination. Lect. Notes Coput. Sc. 854 (1994) 761–772
Weiss, S., Spillinger, I.Y., Silberman, G.M.: Architectural improvements for a data-driven VLSI processing array. J. Parallel Dist. Com. 19 (1993) 308–322
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Šilc, J., Robič, B. (1995). Efficient run-time program allocation on a parallel coprocessor. In: Haridi, S., Ali, K., Magnusson, P. (eds) EURO-PAR '95 Parallel Processing. Euro-Par 1995. Lecture Notes in Computer Science, vol 966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020509
Download citation
DOI: https://doi.org/10.1007/BFb0020509
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60247-7
Online ISBN: 978-3-540-44769-6
eBook Packages: Springer Book Archive