Skip to main content
SpringerLink
Log in

Automatic synthesis of parallel algorithms

  • Chapter
  • First Online:
Solving Combinatorial Optimization Problems in Parallel

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

  • 226 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.Ancourt, F.Irigoin, “Scanning polyhedra with DO loops”, Proceedings 3rd SIGPLAN Symposium on Principles and Practice of Parallel Programming, ACM Press, pp. 39–50, 1991.

    Google Scholar 

  2. R.Andonov, F.Gruau, “A 2D modular toroidal systolic array for the knapsack problem”, Proceedings ASAP 91, pp. 458–472, 1991.

    Google Scholar 

  3. R.Andonov, P.Quinton, “Efficient linear systolic array for the knapsack problem”, Proceedings CONPAR 92, Lecture Notes in Computer Science, no. 634, pp. 247–258, 1992.

    Google Scholar 

  4. M.Barnett, C.Lengauer, “Loop parallelization and unimodularity”, Algorithmique Parallèle, M.Cosnard, M.Nivat (eds.), Masson, 1992.

    Google Scholar 

  5. M.Barnett, C.Lengauer, “Unimodularity considered non-essential”, Proceedings CONPAR-92, Lecture Notes in Computer Science, no. 634, pp. 659–664, Springer-Verlag, 1992.

    Google Scholar 

  6. J.C.Bu, E.F.Deprettere, P.Dewilde, “A design methodology for fixed-size systolic arrays”, Proceedings International Conference on Application Specific Array, IEEE Press, pp. 591–602, 1990.

    Google Scholar 

  7. B.Carré, Graphs and networks. Oxford Applied Mathematics and Computing Science Series, Oxford University Press, 1979.

    Google Scholar 

  8. G.Chen, M.Chern, J.Jang, “Pipeline architectures for dynamic programming algorithms”, Parallel Computing, vol. 13, pp. 111–117, 1990.

    Article  Google Scholar 

  9. V.Chvátal, Linear programming. W.H.Freeman and Company, 1983.

    Google Scholar 

  10. N.V.Chernikiva, “Algorithm for finding a general formula for the non-negative solutions of a system of linear inequalities”, U.S.S.R. — Computational Mathematics and Mathematical Physics, vol. 5, pp. 228–233, 1965.

    Article  Google Scholar 

  11. P.Clauss, C.Mongenet, “Synthesis aspects in the design of efficient processor arrays from affine recurrence equations”, Journal of Symbolic Computation, vol. 15, pp. 547–569, 1993.

    Google Scholar 

  12. A.Darte, “Regular partitioning for synthesizing fixed-size systolic arrays”, Integration — Journal of VLSI, vol. 12, pp. 293–304, 1991.

    Article  Google Scholar 

  13. A.Darte, L.Khachiyan, Y.Robert, “Linear scheduling is nearly optimal”, Parallel Processing Letters, vol. 1, no. 2, pp. 73–81, 1991.

    Article  Google Scholar 

  14. A.Darte, Y.Robert, “Constructive methods for scheduling uniform loop nests”, IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 8, pp. 814–822, 1994.

    Article  Google Scholar 

  15. P.Feautrier, “Parametric integer programming”, RAIRO Recherche Opérationnelle, vol. 22, pp. 243–268, 1988.

    Google Scholar 

  16. P.Feautrier, “Some efficient solutions to the affine scheduling problem, part I, one dimensional time”, Journal of Parallel Programming, vol. 21, no. 5, pp. 313–348, 1992.

    Article  Google Scholar 

  17. P.Feautrier, “Some efficient solutions to the affine scheduling problem, part II, multidimensional time”, Journal of Parallel Programming, vol. 21, no. 6, pp. 389–420, 1992.

    Article  Google Scholar 

  18. P.Feautrier, “Towards automatic distribution”, Parallel Processing Letters, vol. 4, no. 3, pp. 233–244, 1994.

    Article  Google Scholar 

  19. J.A.B.Fortes, D.Moldovan, “Data broadcasting in linearly scheduled array processors”, Proceedings 11th Annual Symposium on Computer Architecture, pp. 224–231, 1984.

    Google Scholar 

  20. M.Garey, D.Johnson, Computers and intractability: a guide to the theory of NP-Completeness. Freeman, 1979.

    Google Scholar 

  21. T.E.Gerasch, “A parallel approximation algorithm for 0/1 knapsack”, Proceedings International Conference on Parallel Processing, pp. 302–303, 1991.

    Google Scholar 

  22. D.E.Goldberg, Genetic Algorithms in Search Optimisation and Machine Learning. Addison Wesley, 1989

    Google Scholar 

  23. L.J.Guibas, H.T.Kung, C.D.Thompson, “Direct VLSI implementation of combinatorial algorithms”, Proceedings Caltech Conference on VLSI, pp 509–525, 1979.

    Google Scholar 

  24. T.C.Hu, Combinatorial algorithms. Addison-Wesley Publishing Company, 1982.

    Google Scholar 

  25. F.Irigoin, R.Triolet, “Supernode partitioning”, Proceedings 15th POPL, San Diego, California, pp. 319–328, 1988.

    Google Scholar 

  26. J.Jansen, F.M.Dijstermans, “Parallel branch-and-bound algorithms”, Future Generation Computer Systems, vol. 4, pp. 271–279, 1988.

    Article  Google Scholar 

  27. R.M.Karp, R.E.Miller, S.Winograd, “The organization of computations for uniform recurrence equations”, Journal of the ACM, vol. 14, no. 3, pp. 563:590, 1967.

    Google Scholar 

  28. L.Lamport, “The parallel execution of DO loops”, Communications of the ACM, vol. 17, no. 2, pp. 83–93, 1974.

    Article  Google Scholar 

  29. P.Lee, Z.M.Kedem, “Synthesizing linear array algorithms from nested loop algorithms”, IEEE Transactions on Computers, vol. C-37, no. 12, pp. 1578–1598, 1988.

    Google Scholar 

  30. P.Lee, Z.M.Kedem, “Mapping nested loop algorithms into multi-dimensional systolic arrays”, IEEE Transactions Parallel and Distributed Systems, vol. 1, no. 1, pp. 64–76, 1990.

    Article  Google Scholar 

  31. S.Martello, P.Toth, Knapsack problems: algorithms and computer implementation. John Wiley and Sons, 1990.

    Google Scholar 

  32. G.M.Megson, An Introduction to Systolic Algorithm Design. Oxford Science Publications, 1992.

    Google Scholar 

  33. G.M.Megson, “The derivation of uniform recurrences for the knapsack problem”, Journal of Parallel Algorithms and Applications, vol. 1, pp. 127–140, 1993.

    Google Scholar 

  34. G.M.Megson, “Mapping a class of run-time dependencies onto regular arrays”, Proceedings 7th International Parallel Processing Symposium, IEEE Computer Society Press, pp. 97–104, 1993.

    Google Scholar 

  35. G.M.Megson (ed.), Transformational approaches to systolic design. Chapman-Hall Parallel and Distributed Computing Series 2, 1994.

    Google Scholar 

  36. G.M.Megson, X.Chen, “Partitioning and mapping for lower dimensional given arrays”, Proceedings 2nd Euromicro Workshop on Parallel and Distributed Computing, IEEE Computer Society Press, pp. 149–156, 1994.

    Google Scholar 

  37. G.M.Megson, X.Chen, “Synthesis of knapsack problems into fixed size arrays with lower dimensions”, University of Newcastle upon Tyne, Technical Report Series, no. 486, 1994.

    Google Scholar 

  38. D.I.Moldovan, A.B.Fortes, “Partitioning and mapping algorithms into fixed size systolic arrays”, IEEE Transaction on Computer, vol. c-35, no. 1, pp. 1–12, 1986.

    Google Scholar 

  39. R.-W.Mourad, P.Feautrier, “On parallel program generation for massively parallel architectures”, Proceedings High Performance Computing II, North-Holland, 1991.

    Google Scholar 

  40. E.D.Nering, Linear algebra and matrix theory. J.Wiley & Sons Inc., 1963.

    Google Scholar 

  41. P.Quinton, “The systematic design of systolic arrays”, INRIA Technical Report, no. 216, 1983.

    Google Scholar 

  42. P.Quinton, “Automatic synthesis of systolic arrays from uniform recurrent equations”, IEEE/ACM Proceedings 11th Annual International Symposium on Computer Architecture, 1984.

    Google Scholar 

  43. P.Quinton, Y.Robert, Systolic algorithms and architectures. Masson and Prentice Hall International, 1991.

    Google Scholar 

  44. P.Quinton, V.VanDongen, “The mapping of linear recurrence equations on regular arrays”, Journal of VLSI Signal Processing, vol. 1, pp. 95–113, 1989.

    Google Scholar 

  45. S.V. Rajopadhye, “Synthesizing systolic arrays with control signals from recurrence equations”, Distributed Computing, vol. 2, pp. 88–105, 1989.

    Article  Google Scholar 

  46. S.V.Rajopadhye, R.M.Fujimoto, “Systolic array synthesis by static analysis of program dependencies”, Proceedings PARLE — Parallel Architectures and Languages Europe, Eindhoven, The Netherlands, June 1987, Lecture Notes in Computer Science, Springer-Verlag, no. 258, 1987.

    Google Scholar 

  47. S.V.Rajopadhye, and R.M.Fujimoto, “Automating systolic array design”, Integration — The VLSI Journal, vol. 9, pp. 225–242, 1989.

    Article  Google Scholar 

  48. S.V.Rajopadhye, R.M.Fujimoto, “Synthesizing systolic arrays from recurrence equations”, Parallel Computing, vol. 14, no. 2, pp. 163–189, 1990.

    Article  Google Scholar 

  49. S.K.Rao, Regular iterative algorithms and their Implementation on processor arrays. PhD Thesis, Stanford University, 1985.

    Google Scholar 

  50. L.Rapanotti, G.M.Megson, “Uniformisation techniques for integral recurrence equations”, The University of Newcastle upon Tyne, Computing Science, Technical Report Series, no. 478, 1994.

    Google Scholar 

  51. L. Rapanotti, G.M.Megson, “Pre-processing in SADE: Stage III”, The University of Newcastle upon Tyne, Computing Science, Technical Report Series, no. 471, 1994

    Google Scholar 

  52. A.Schrijver, Theory of linear and integer programming. Wiley-Interscience Series in Discrete Mathematics and Optimization, 1986.

    Google Scholar 

  53. W.Shang, J.A.B.Fortes, “Time optimal linear schedules for algorithms with uniform dependencies”, IEEE Transactions on Computers, vol. 40, no. 6, pp. 723–742, 1991.

    Article  Google Scholar 

  54. W.Shang, J.A.B.Fortes, “On time mapping of uniform dependence algorithms into lower dimensional processor arrays”, IEEE Transactions on Parallel and Distributed Systems, vol. 3, no. 3, pp. 350–363, 1992.

    Article  Google Scholar 

  55. W.Shang, J.A.B.Fortes, “Independent partitioning of algorithms with uniform dependencies”, IEEE Transactions on Parallel and Distributed Systems, vol. 41, no. 2, pp. 190–206, 1992.

    Google Scholar 

  56. J.Teich, L.Thiele, “Control generation in the design of processor arrays”, Journal of VLSI Signal Processing, vol. 3, no. 1/2, pp. 77–92, 1991.

    Article  Google Scholar 

  57. Y.Wong, J.M.Delosme, “Broadcasts removal in systolic algorithms”, Proceedings International Conference on Systolic Arrays, 1988.

    Google Scholar 

  58. Y. Wong, J.M.Delosme, “Transformation of broadcasts into propagations in systolic algorithms”, Journal of Parallel and Distributed Computing, vol. 14, no. 2, pp. 121–145, 1992.

    Article  Google Scholar 

  59. Y.Wong, J.M.Delosme, “Optimisation of computation time for systolic arrays”, IEEE Transactions on Computers, vol. 41, no. 2, pp. 159–177, 1992.

    Article  Google Scholar 

  60. J.Xue, The formal synthesis of control signals for systolic arrays. The University of Edinburgh, PhD Thesis, CTS-90-92, April 1992.

    Google Scholar 

  61. J.Xue, “Automating non-unimodular transformations of loop nests”, Parallel Computing, vol. 20, no. 5, pp. 711–728, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing Science, Univ. of Newcastle upon Tyne, Claremont Tower, Claremont Road, NE1 7RU, Newcastle upon Tyne, UK

    G. M. Megson, L. Rapanotti & X. Chen

Authors
  1. G. M. Megson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Rapanotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. X. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Afonso Ferreira Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Megson, G.M., Rapanotti, L., Chen, X. (1996). Automatic synthesis of parallel algorithms. In: Ferreira, A., Pardalos, P. (eds) Solving Combinatorial Optimization Problems in Parallel. Lecture Notes in Computer Science, vol 1054. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027118

Download citation

  • DOI: https://doi.org/10.1007/BFb0027118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61043-4

  • Online ISBN: 978-3-540-49875-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation