Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/800223.806765acmconferencesArticle/Chapter ViewAbstractPublication PagesfpcaConference Proceedingsconference-collections
Article
Free access

Resource management in dataflow

Published: 18 October 1981 Publication History
  • Get Citation Alerts
  • Abstract

    Recent proposals for nondeterministic facilities in high-level dataflow programming systems have stopped short of giving details of low-level implementation. The underlying machine is assumed to provide basic nondeterministic operations which lead to the required high-level effects. This paper gives details of a practical implementation of one such high-level language, Id {3}, for a specific dataflow computer, the Manchester prototype {11}. It adds to previous work by the authors {7, 8} in which implementations of Communicating Processes {12} and Distributed Processes {5} were proposed.
    Id is based on an unravelling dataflow interpreter which closely resembles the labelled token scheme used in the Manchester prototype. Thus translation of Id programs into suitable machine code is relatively straightforward. However, instead of requiring complex nondeterministic operators to support resource managers as in {1}, the existing simple matching functions of the Manchester system {8} prove to be adequate.
    For the non-specialist reader, the Manchester labelled dataflow schema and the resource management constructs of Id are outlined before details of implementation are given.

    References

    [1]
    Arvind and K.P.Gostelow, A Computer Capable of Exchanging Processors for Time, Information Processing 77, North Holland, 1977, 849-853.
    [2]
    Arvind, K.P.Gostelow and W.PLouffe, Indeterminacy, Monitors and Dataflow, Proceedings of the Sixth Symposium on Operating Systems Principles, November 1977, 159-169.
    [3]
    Arvind, K.P.Gostelow and W.Plouffe, An Asynchronous Programming Language and Computing Machine, Department of Information and Computer Science, University of California, Irvine, December 1978.
    [4]
    D.L.Bowen, Implementation of Data Structures on a Dataflow Computer, Ph.D. Thesis, University of Manchester, June 1981.
    [5]
    P.Brinch Hansen, Distributed Processes: A Concurrent Programming Concept, Communications of the ACM, vol.21, no.11, November 1978, 934-941.
    [6]
    A.J.Catto, Nondeterministic Programming in a Dataflow Environment, Ph.D. Thesis, University of Manchester, July 1981.
    [7]
    A.J.Catto and J.R.Gurd, Nondeterministic Dataflow Graphs, Information Processing 80, North Holland, 1980, 251-256.
    [8]
    A.J.Catto, J.R.Gurd and C.C.Kirkham, Nondeterministic Dataflow Programming, Proceedings of the Sixth ACM European Regional Conference, March 1981, 435-444.
    [9]
    N.De Francesco et.al., On the Feasibility of Nondeterministic and Interprocess Constructs in Dataflow Computing Systems, Proceedings of the First European Conference on Parallel and Distributed Processing, February 1979, 93-100.
    [10]
    J.R.Gurd, J.R.W.Glauert and C.C.Kirkham, Generation of Dataflow Graphical Object Code for the Lapse Programming Language, Lecture Notes in Computer Science, vol.111, June 1981, 155-168.
    [11]
    J.R.Gurd and I.Watson, Data Driven System for High Speed Parallel Computing, Computer Design, vol.9, nos.6 and 7, June and July 1980, 91-100 and 97-106.
    [12]
    C.A.R.Hoare, Communicating Sequential Processes, Communications of the ACM, vol.21, no.8, August 1978, 666-677.
    [13]
    P.R.Kosinski, A Dataflow Language for Operating Systems Programming, ACM Sigplan Notices, vol.8, no.9, September 1973, 89-94.

    Cited By

    View all
    • (2005)Streams and managersOperating Systems Engineering10.1007/3-540-11604-4_66(452-465)Online publication date: 1-Jun-2005
    • (2005)Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line codeInternational Symposium on Programming10.1007/3-540-11494-7_14(194-211)Online publication date: 27-May-2005
    • (1989)The Post-Game Analysis Framework-Developing Resource Management Strategies for Concurrent SystemsIEEE Transactions on Knowledge and Data Engineering10.1109/69.879761:3(293-309)Online publication date: 1-Sep-1989
    • Show More Cited By

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    FPCA '81: Proceedings of the 1981 conference on Functional programming languages and computer architecture
    October 1981
    228 pages
    ISBN:0897910605
    DOI:10.1145/800223
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 18 October 1981

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)29
    • Downloads (Last 6 weeks)2
    Reflects downloads up to

    Other Metrics

    Citations

    Cited By

    View all
    • (2005)Streams and managersOperating Systems Engineering10.1007/3-540-11604-4_66(452-465)Online publication date: 1-Jun-2005
    • (2005)Optimizing for a multiprocessor: Balancing synchronization costs against parallelism in straight-line codeInternational Symposium on Programming10.1007/3-540-11494-7_14(194-211)Online publication date: 27-May-2005
    • (1989)The Post-Game Analysis Framework-Developing Resource Management Strategies for Concurrent SystemsIEEE Transactions on Knowledge and Data Engineering10.1109/69.879761:3(293-309)Online publication date: 1-Sep-1989
    • (1986)Structure handling in data-flow systemsIEEE Transactions on Computers10.1109/TC.1986.500942635:6(489-502)Online publication date: 10-Jun-1986
    • (1986)Primitives for resource management in a demand-driven reduction modelInternational Journal of Parallel Programming10.1007/BF0141455515:3(215-244)Online publication date: 1-Jun-1986
    • (1984)Dataflow resource managers and their synthesis from open path expressionsIEEE Transactions on Software Engineering10.1109/TSE.1984.501023310:3(244-256)Online publication date: 26-May-1984
    • (1982)A Practical Data Flow ComputerComputer10.1109/MC.1982.165394115:2(51-57)Online publication date: 1-Feb-1982
    • (1982)The U-InterpreterComputer10.1109/MC.1982.165394015:2(42-49)Online publication date: 1-Feb-1982

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media