Advertisement

Sadhana

, Volume 17, Issue 1, pp 193–220 | Cite as

Scalable concurrent computing

  • Nalini Venkatasubramanian
  • Shakuntala Miriyala
  • Gul Agha
Special Issue On Parallel And Distributed Computing
  • 24 Downloads

Abstract

This paper focusses on the challenge of building and programming scalable concurrent computers. The paper describes the inadequacy of current models of computing for programming massively parallel computers and discusses three universal models of concurrent computing — developed respectively by programming, architecture and algorithm perspectives. These models provide a powerful representation for parallel computing and are shown to be quite close. Issues in building systems architectures which efficiently represent and utilize parallel hardware resources are then discussed. Finally, we argue that by using a flexible universal programming model, an environment supporting heterogeneous programming languages can be developed.

Keywords

Scalabe concurrent computing massively parallel computers systems architectures heterogeneous programming languages 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agha G 1986Actors: A model of concurrent computation in distributed systems (Cambridge, ma: mit Press)Google Scholar
  2. Agha G 1989 Supporting multiparadigm programming on actor architectures. InProceedings of Parallel Architectures and Languages Europe, Vol. II: Parallel Languages (PARLE’89) Lecture Notes in Computer Science. Vol. 366 (Berlin: Springer-Verlag) pp. 1–19Google Scholar
  3. Agha G 1990 Concurrent object oriented programming.Commun. ACM 33 (9): 125–141CrossRefGoogle Scholar
  4. Agha G 1991 The structure and semantics of actor languages. InFoundation of object-oriented languages. Lecture Notes in Computer Science. Vol. 489 (Berlin: Springer-Verlag) pp. 1–59Google Scholar
  5. Agha G, Hewitt C 1987 Actors: A conceptual foundation for concurrent object-oriented programming. InResearch directions in object oriented programming (Cambridge, ma: mit Press)Google Scholar
  6. Agha G, Jagannathan S 1991 Reflection in concurrent systems: A model of concurrent continuations, Technical Report, University of Illinois at Urbana ChampaignGoogle Scholar
  7. Appel A, Ellis J, Li K 1988 Real-time concurrent collection on stock multiprocessors. In:SIGPLAN’88 Conference on Programming Language Design and Implementation Atlanta, GAGoogle Scholar
  8. Arvind, Culler D E 1986 Dataflow architectures. InAnnu. Rev. Comput. Sci. 1: 225–253CrossRefGoogle Scholar
  9. Arvind, Nikhil R, Pingali K 1987 I-structures: Data structures for parallel computing, Technical Report Computation Structures Group Memo 269, Massachusetts Institute of Technology, Cambridge, maGoogle Scholar
  10. Athas W 1987Fine grain concurrent computations, Ph D dissertation, Computer Science Department, California Institute of Technology (also published as technical report 5242: tr: 87)Google Scholar
  11. Athas W, Seitz C 1988 Multicomputers: Message-passing concurrent computers.ieee Comput. pp. 9–23Google Scholar
  12. Baker H, Hewitt C 1977 The incremental garbage collection of processes, Technical Report Memo al-454, Massachusetts Institute of Technology, mit Artificial Intelligence LaboratoryGoogle Scholar
  13. Baude F, Vidal-Naquet G 1991 Actors as a parallel programming model. InProceedings of the 8th Symp. on Theoretical Aspects of Computer Sciences: Lecture Notes in Computer Science. Vol. 480 (Berlin: Springer-Verlag) pp. 184–195Google Scholar
  14. Bevan D I 1987 Distributed garbage collection using reference counting. InParallel architecture and languages Europe: Lecture Notes in Computer Science. Vol. 259 (Berlin: Springer-Verlag) pp. 273–288Google Scholar
  15. Cheney C J 1970 A nonrecursivelist compacting algorithm.Commun. ACM 13: 677–678MATHCrossRefGoogle Scholar
  16. Dally W J 1986A VLSI architecture for concurrent data structures (Kluwer: Academic Press)Google Scholar
  17. Dally W J, Wills S 1989 Universal mechanisms for concurrency. InParallel architecture and language Europe: Lecture Notes in Computer Science. Vol. 365 (Eindhoven: Springer-Verlag) pp. 19–33Google Scholar
  18. Deutsch P, Bobrow D G 1976 An efficient, incremental, automatic garbage collector.Commun. ACM 19: 522–526MATHCrossRefGoogle Scholar
  19. Dijkstra E W, Lamport L, Martin A J, Scholten C S, Steffens E F M 1978 On-the-fly garbage collection: An exercise in cooperation.Commun. ACM 21: 966–975MATHCrossRefGoogle Scholar
  20. Fenichel R R, Yochelson J C 1969 A lisp garbage collector for virtual memory systems.Commun. ACM 12: 611–612MATHCrossRefGoogle Scholar
  21. Goldberg B 1989 Generational reference counting: A reduced-communication distributed storage reclamation scheme (1989). InSIGPLAN’89 Conference on Programming Language Design and Implementation (Portland, or: acm Press)Google Scholar
  22. Goto A, Sato M, Nakajima K, Taki K, Matsumoto A 1988 Overview of the parallel inference machine architecture. InFifth generation computing systems (Tokyo: icot)Google Scholar
  23. Hewitt C 1977 Viewing control structures as patterns of passing messages.J. Artif. Intell. 8: 323–364CrossRefGoogle Scholar
  24. Hillis D 1985The connection machine (Cambridge, ma: mit Press)Google Scholar
  25. Hoare C A R 1978 Communicating sequential processes.Commun. ACM 21: 666–677MATHCrossRefGoogle Scholar
  26. Hudak P, Keller R M 1982 Garbage collection and task deletion in distributed applicative processing systems. Inacm Symposium on LISP and Functional Programming (Portland, or: acm Press)Google Scholar
  27. Hwang K, Briggs F 1984Computer architecture and parallel processing (New York: McGraw Hill)MATHGoogle Scholar
  28. Ichisugi Y, Yonezawa A 1990 Distributed garbage collection using group reference counting, Technical report, University of Tokyo, Dept. of Information ScienceGoogle Scholar
  29. Jul E 1989Object mobility in a distributed object-oriented system, Ph D thesis, University of WashingtonGoogle Scholar
  30. Kung H T 1986 Memory requirements for balanced computer architectures. InProc. of the 13th Annual Symposium on Computer Architecture (New York: ieee Press)Google Scholar
  31. Lieberman H, Hewitt C 1983 A real-time garbage collector based on the lifetimes of objectsCommun.ACM 26: 419–429CrossRefGoogle Scholar
  32. Lim J, Johnson R 1989 The heart of object oriented concurrent programming.Sigplan Notices 24(4): 165–167CrossRefGoogle Scholar
  33. Madsen O L 1987Block-structure and object oriented languages (Cambridge, ma: mit Press)Google Scholar
  34. Maes P 1987Computational reflection, Ph D thesis, Vrije University, Brussels, Belgium (Technical Report 87-2)Google Scholar
  35. Miriyala S 1991Visual representation of actors using predicate transition nets, Master’s thesis, Dept. of Computer Science, University of Illinois, Urbana-Champaign, Urbana, ilGoogle Scholar
  36. Pallas J, Ungar D 1988 Multiprocessor smalltalk: A case study of a multiprocessor-based programming environment. InSIGPLAN Conference on Programming Language Design and Implementation Google Scholar
  37. Sargeant J 1986 Load balancing, locality and parallelism control in fine-grained parallel machines, Technical Report umcs-86-11-5, Dept. of Computer Science, University of ManchesterGoogle Scholar
  38. Shapiro E 1987Concurrent prolog: Collected papers, Series in Logic Programming (Cambridge, ma: mit Press)Google Scholar
  39. Singh V, Kumar V, Agha G, Tomlinson C 1991 Scalability of parallel sorting on mesh multicomputers. InProceedings of the International Parallel Processing Symposium Google Scholar
  40. Steele G L 1975 Multiprocessing compactifying garbage collection.Commun. ACM 18: 495–508MATHCrossRefGoogle Scholar
  41. Ungar D M 1984 Generation scavenging — a non-disruptive high performance storage reclamation algorithm. InSoftware Engineering Symposium on Practical Software Development Environments, Pittsburgh, paGoogle Scholar
  42. Valiant G 1990 A bridging model for parallel computation.Comput. ACM 33: 103–111CrossRefGoogle Scholar
  43. Venkatasubramanian N 1991Hierarchical memory management for parallel machines, Masters’s thesis, Dept. of Computer Science, University of Illinois, Urbana-Champaign, Urbana, II (forthcoming)Google Scholar
  44. Watson P, Watson I 1987 An efficient garbage collection scheme for parallel computer architectures. InParallel Architectures and Languages Europe, Lecture Notes in Computer Science. Vol. 259 (Berlin: Springer-Verlag) pp. 432–443Google Scholar
  45. Wegner P 1990 Concepts and paradigms of object-oriented programming. InOOPS Messenger 1(1): 7–87CrossRefGoogle Scholar
  46. Wills D S 1990Pi: A parallel architecture interface for multi-model execution, Ph D thesis, Massachusetts Institute of Technology, Cambridge, MassachusettsGoogle Scholar
  47. Yonezawa A 1990ABCL: An object-oriented concurrent system (Cambridge, ma: mit Press)Google Scholar

Copyright information

© the Indian Academy of Sciences 1992

Authors and Affiliations

  • Nalini Venkatasubramanian
    • 1
  • Shakuntala Miriyala
    • 1
  • Gul Agha
    • 1
  1. 1.Department of Computer ScienceUniversity of Illinois at Urbana-ChampaignUrbanaUSA

Personalised recommendations