Abstract
A formal method to schedule algorithms for the special case of 3D → 1D spatial mapping is proposed. The method is based on a technique of two-dimensional scheduling. Initial 3D algorithms should be represented as a system of uniform recurrence equations or as a uniform loopn est. The method can be generalized for the case of 4D → 2D, 5D → 3D spatial mapping or for the case of affine scheduling with the same linear part.
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
Karp, R. M., Miller, R. E., Winograd, S.: The organization of computations for uniform recurrence equations. J. of the ACM. 14(3) (1967) 563–590
Banerjee, U.: An introduction to a formal theory of dependence analysis. J. Supercomput. (2) (1988) 133–149
Kung, S.-Y.: VLSI array processors. (Prentice-Hall, Englewood Cliffs, NJ, 1988)
Lee, P., Kedem, Z. M.: Mapping nested loop algorithms into multidimensional systolic arrays. IEEE Trans. on Parallel and Distributed Syst. 1 (1990) 64–76
Kosianchouk, V. V., Likhoded, N. A., Sobolevskii, P. I.: Systolic architecture array synthesis. Prepr., n. 6, Inst. of Math., Acad. of Sci. of Belarus, Minsk, 1992
Shang, W., Fortes, J. A. B.: On time mapping of uniform dependence algorithms into lower dimensional processor arrays. IEEE Trans. on Parallel and Distributed Syst. 3 (3) (1992) 350–362
Likhoded, N. A. Scheduling of algorithms with uniform dependencies: case of 3D → 1D mapping. Proc. 5th Australasian. Conf. on Parallel and Real-Time Systems. Adelaide, Australia, September 28-29, 1998. Springer-Verlag, 401–408
Feautrier, P.: Some efficient solutions to the affine scheduling problem, part II, multidimensional time. Int. J. of Parallel Programming 21(6) (1992) 389–420
Darte, A., Vivien, F.: Revisiting the decomposition of Karp, Miller, Winograd. Parallel Processing Letters 5(4) (1995) 551–562
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
Likhoded, N. (1999). Two-Dimensional Scheduling of Algorithms with Uniform Dependencies. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1999. Lecture Notes in Computer Science, vol 1662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48387-X_10
Download citation
DOI: https://doi.org/10.1007/3-540-48387-X_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66363-8
Online ISBN: 978-3-540-48387-8
eBook Packages: Springer Book Archive