Hybrid structure: A scheme for handling data structures in a data flow environment

  • A. R. Hurson
  • B. Lee
  • B. Shirazi
Submitted Presentations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 365)


The asynchronous nature of data flow model of computation allows the exploitation of maximum inherent parallelism in many application programs. However, before data flow model of computation can become a viable alternative to control flow model of computation, one has to find practical solutions to some major problems such as efficient handling of data structures.

This article introduces a new model for handling data structures in a data flow environment. The proposed model combines both aspects of copying and sharing to optimize the storage and processing overhead incurred during the operations on data structures. In addition, using simulation, a comparative analysis of our model against other data structure models proposed in literature is presented.


Data Flow Hybrid Structure Hybrid Scheme Array Size Storage Overhead 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

VI. References

  1. [1]
    Ackerman, W. B., "A Structure Memory for Data Flow Computers," Lab. Comput. Sci., Massachusetts Inst. Technol., Cambridge, Tech. Rep. MIT TR-186, Aug. 1977.Google Scholar
  2. [2]
    Ackerman, W. B., "A Structure Processing Facility for Data Flow Computers," presented at Int. Conf. on Parallel Processing, Aug. 1978.Google Scholar
  3. [3]
    Ackerman, W. B., "Data flow languages," IEEE Computer, Vol. 15, No. 2, Feb. 1982, pp. 15–23.Google Scholar
  4. [4]
    Arvind and Thomas, "I-Structures: An Efficient Datatype for Functional Languages," TM-178, Laboratory for Comp. Sc., MIT, Cambridge, Mass., Sept. 1980.Google Scholar
  5. [5]
    Arvind and V. Kathail, "Multiple Processor Dataflow Machine That Supports Generalized Procedures," The 8th Annual Symposium on Computer Architecture, May, 1981, pp. 291–302.Google Scholar
  6. [6]
    Arvind, Nikhil, R. S. and Pingali, K. K., "I-structures: Data Structures for Parallel Computing," Proceedings of the Workshop on Graph Reduction. Los Alamos, NM, 1986.Google Scholar
  7. [7]
    Bohm, A. P. W., J. R. Gurd, J. Sargeant, "Hardware and Software Enhancement of the Manchester Dataflow Machine," IEEE Compcon, Spring 1985, pp. 420–423.Google Scholar
  8. [8]
    Dennis, J. B. and D. P. Misunas, " A Preliminary Architecture for a Basic Dataflow Processor," Proc. Second Ann. Symp. Computer Architecture, Jan. 1975, pp. 126–132.Google Scholar
  9. [9]
    Gajski, D. D., Padua, D. A., Kuck, D. J. and Kuhn, R. H. "A second opinion on data flow machines and languages," IEEE Computer, Feb 1982, pp. 58–69.Google Scholar
  10. [10]
    Gaudiot, J.-L., "Structure Handling in Data-Flow Systems," IEEE Trans. on Computers, Vol. c-35, No. 6, June 1986, pp. 489–502.Google Scholar
  11. [11]
    Gaudiot, J.-L., and Ercegovac, M. D., "A Scheme for handling arrays in data-flow system," in Proc. 3rd Int. Conf. Distrib. Comput. Syst., Fort Lauderdale, FL, Oct. 1982.Google Scholar
  12. [12]
    Gostelow, K. P. and Thomas, R. E., "A view of dataflow," AFIPS Conf. Proc., vol. 48, June 1979, pp. 629–636.Google Scholar
  13. [13]
    Gostelow, K. P. and Thomas, R. E., "Performance of a simulated data flow computer," IEEE Transactions on Computer, vol. c-29, Oct. 1980, pp. 905–919.Google Scholar
  14. [14]
    Kawakami, K. and Gurd, J. R., "A Scalable Dataflow Structure Store," Symposium on Computer Architecture, '86, pp. 243–250.Google Scholar
  15. [15]
    Lee, B. and Hurson, A. R., "Data Structure Handling In Data Flow," Technical Report TR-88-059, Department of Electrical Engineering, The Pennsylvania State University.Google Scholar
  16. [16]
    Misunas, D., "Structure Processing In Data-Flow Computer," Sagamore Computer Conference on Parallel Processing, 1975, pp. 230–234.Google Scholar
  17. [17]
    Patnaik, L. M., Govindarajan, R. and Ramadoss, N. S., "Design and Performance Evaluation of EXMAN: An EXtended MANchester Data flow Computer," IEEE Transactions on Computers, Vol. c-35, No. 3, March 1986, pp. 229–243.Google Scholar
  18. [18]
    Samet, S. and Gokhale, M., "Data Structures On Data Flow Computers: Implementations and Problems," IEEE 1984 Micro-Delcon, pp. 84–96.Google Scholar
  19. [19]
    Sargeant, J. and Kirkham, C. C., "Stored Data Structures on the Manchester Data flow Machine," Symposium on Computer Architecture, '86, pp. 235–242.Google Scholar
  20. [20]
    Smith, A. J., "Multiprocessor Memory Organization and Memory Interference," Communication of the ACM, vol. 20, No. 20, Oct. 1977, pp. 754–761.CrossRefGoogle Scholar
  21. [21]
    Srini, V. P., "An Architectural Comparison of Data Flow Systems," IEEE Computer, Vol. 19, No.3, March 1986, pp. 68–86.Google Scholar
  22. [22]
    Watson, I. and J. R. Gurd, "A Practical Data Flow Computer," IEEE Computer, Vol. 15 no. 2, February 1982, pp 51–57.Google Scholar
  23. [23]
    Weng, K. S., "Stream-oriented computation in recursive data flow schemas," Lab. Comput. Sci. MIT, Cambridge, MA, Tech. Rep. 68, Oct. 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • A. R. Hurson
    • 1
  • B. Lee
    • 1
  • B. Shirazi
    • 2
  1. 1.Computer Engineering Program Department of Electrical EngineeringThe Pennsylvania State UniversityUniversity Park
  2. 2.Department of Computer ScienceSouthern Methodist UniversityDallas

Personalised recommendations