Skip to main content
SpringerLink
Log in

Two-Dimensional Scheduling of Algorithms with Uniform Dependencies

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1662))

Included in the following conference series:

  • 343 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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

    Article  MATH  MathSciNet  Google Scholar 

  2. Banerjee, U.: An introduction to a formal theory of dependence analysis. J. Supercomput. (2) (1988) 133–149

    Article  Google Scholar 

  3. Kung, S.-Y.: VLSI array processors. (Prentice-Hall, Englewood Cliffs, NJ, 1988)

    Google Scholar 

  4. Lee, P., Kedem, Z. M.: Mapping nested loop algorithms into multidimensional systolic arrays. IEEE Trans. on Parallel and Distributed Syst. 1 (1990) 64–76

    Article  Google Scholar 

  5. 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

    Google Scholar 

  6. 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

    Article  Google Scholar 

  7. 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

    Google Scholar 

  8. Feautrier, P.: Some efficient solutions to the affine scheduling problem, part II, multidimensional time. Int. J. of Parallel Programming 21(6) (1992) 389–420

    Article  MATH  MathSciNet  Google Scholar 

  9. Darte, A., Vivien, F.: Revisiting the decomposition of Karp, Miller, Winograd. Parallel Processing Letters 5(4) (1995) 551–562

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, National Academy of Sciences of Belarus, Surganov str., 11, Minsk, 220072, Belarus

    N.A. Likhoded

Authors
  1. N.A. Likhoded
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computing Center, 6 Lavrentiev Avenue, Novosibirsk, 630090, Russia

    Victor Malyshkin

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation