Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

A methodology for designing and modeling reconfigurable systems

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

The problem of designing communicating systems with internal state and facilities for reconfiguration is considered. A technique for designing such systems, called dynamically reconfigurable systems, based on a data driven model is proposed. The data driven model uses undirected or partially directed graphs. The nodes of the graphs can represent the components of a concurrent system, modules of an operating system including local and global control elements, and modules of a knowledge-based expert systems. The arcs can represent interconnections between components or data paths for intermodule communication. Each node has a number of attributes including a distinct name, an operation, and a set of specifications describing its input and output arcs. Each arc also has a number of attributes including an arc name, arc type, and the maximum number of tokens the arc can carry. Each node has local memory to store the values of the node and arc attributes and executes in data driven manner. A configuration is an assignment of values to the attributes of the nodes and arcs. Special nodes, called configuration specifying nodes, can assign values to the attributes of nodes and arcs. This process is termed reconfiguration. Reconfiguration is based on the information gathered from the nodes using “snoop arcs.” A formal description of the technique and the execution of a graph are described. The issues related to what, when, and how to reconfigure are identified and resolved. Several reconfiguration strategies are presented using local information, global information, and a combination of the two. Problems arise when local and global requirements are in conflict. A conflict free approach to reconfiguration is presented. Dynamic systems that cannot be accurately modeled using Petri Nets can be modeled using the proposed technique. For example, the Cray-1S computer system has been modeled using the proposed methodology and its architecture analyzed to improve performance. The proposed improvements have been incorporated in the Cray-XMP computer.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. A. Adams, A computation model with data flow sequenching, TR-117, Computer Science Department, School of Humanities and Sciences, Stanford University (December 1968).

  2. R. M. Karp and R. E. Miller, Parallel program schemata,J. Computer System Sciences,3(2):147–195 (May 1969).

    Google Scholar 

  3. J. B. Dennis and J. B. Fosseen, Introduction to data flow schemas, Computation Structures Group Memo: 81, Project MAC, MIT, Cambridge, Massachusetts (1973).

    Google Scholar 

  4. Arvind and K. P. Gostelow, The Id Report: An asynchronous language and computing machine, Dept of Computer and Information Science, TR-114, University of California, Irvine, California (September 1978).

    Google Scholar 

  5. A. L. Davis, The architecture and system method of DDM1: A recursively structured data driven machine,Proc. of 5th Annual Symp. on Comp. Arch., New York, pp. 210–215 (1978).

  6. S. P. Landry and B. D. Shriver, A dataflow simulation research environment, Workshop on Data Driven Languages and Machines, Toulouse, France,10:1–15 (February 1979).

    Google Scholar 

  7. B. D. Shriver and S. P. Landry, An overview of dataflow related research at The University of Southwestern Louisiana, Workshop on Data Driven Languages and Machines, Toulouse, France,5:1–15 (February 1979).

    Google Scholar 

  8. A. Plas, D. Comte, O. Gelly, and J. C. Syre, LAU System Architecture: A parallel data-driven processor based on single assignment,Proc. of Intl. Conf. on Parallel Processing, pp. 293–302 (1976).

  9. A. E. Oldehoeft, Simulated data flow execution of computer programs, Proc. Workshop on Data Driven Languages and Machines, Toulouse, France,10:1–16 (February 1979).

    Google Scholar 

  10. L. J. Moore and E. R. Clayton, GERT Modeling and Simulation, Petrocelli/Charter, New York (1976).

    Google Scholar 

  11. G. Gordon, The Application of GPSS V to Discrete System Simulation, Prentice-Hall Inc., Englewood Cliffs, New Jersey (1975).

    Google Scholar 

  12. P. W. Mallett, Methods of Compacting Microprograms, Ph.D Thesis, Computer Science Department, University of Southwestern Louisiana (December 1978).

  13. E. P. Katz, A Realization of Relational Semantics in an Automatic Programming System, Ph.D Thesis, Computer Science Department, University of Southwestern Louisiana (December 1978).

  14. L. D. Fosdick and L. J. Osterweil, Data flow analysis in software reliability,ACM Computing Surveys 8(3):305–330 (September 1976).

    Google Scholar 

  15. M. R. Shekarchi, The realization of a sample operating system in a dataflow programming language, MS Project, Computer Science Department, University of Southwestern Louisiana (August 1978).

    Google Scholar 

  16. S. P. Landry, The specification and realization of a secure, multi-access operating system using dataflow language and architecture principles, Technical Report, Computer Science Department, University of Southwestern Louisiana (March 1979).

  17. D. T. Nguyen, A dataflow model and semantic specification for the transformational unit, virtual access control unit, and virtual machine monitor, Ph.D Thesis, Computer Science Department, University of Southwestern Louisiana (December 1979).

  18. S. S. Reddi and E. A. Feustel, A restructurable computer system,IEEE TC C-27(1):1–20 (January 1978).

    Google Scholar 

  19. J. Lipovski, On a varistructured array of microprocessors,”IEEE TC C-26 (2):125–137 (February 1977).

    Google Scholar 

  20. Y. Hsia, G. C. C. Chang, and F. D. Erwin, Adaptive wafer scale integration,Proc. of Int. Conf. on Solid State Devices, Tokyo, Japan (August 1979).

  21. S. I. Kartashev and S. P. Kartashev, Dynamic architecture: Problems and solutions,Comp. Mag., pp. 26–40 (July 1978).

  22. R. M. English and G. J. Popek, Dynamic reconfiguration of a distributed operating

  23. B. J. Walker and G. J. Popek, The LOCUS distributed file system, LOCUS Project Report, Computer Science Department, UCLA, Los Angeles, California (1983).

    Google Scholar 

  24. W. F. Clocksin and C. S. Mellish, Programming in prolog, Springer-Verlag, New York (1981).

    Google Scholar 

  25. S. Umeyama and K. Tamura, A parallel execution model of logic programs,Proc. of the 10th Annual Intl. Symp. on Comp. Archit., Stockholm, Sweden, pp. 349–355 (June 1983).

  26. E. I. Organick, The multics system: An examination of its structure, MIT Press, Cambridge, Massachusetts (1972).

    Google Scholar 

  27. K. S. Weng, Stream oriented computation in recursive data flow schemas, Technical Memoranda 68, Laboratory for Computer Science, MIT, Cambridge, Massachusetts (October 1975).

    Google Scholar 

  28. C. A. Petri, Communications in automaton, University of Bonn (1962); Translation: C. F. Greene, Supp. 1 to TR. RADC-TR-65-337, Vol. 1, Rome Air Development Center, Griffiss Air Force Base, New York (1965).

  29. J. L. Peterson, Petri Nets,ACM Computing Surveys 9(3):223–252 (September 1977).

    Google Scholar 

  30. R. M. Russell, The Cray-1 Computer System,Comm. of the ACM 21(1):63–72 (January 1978).

    Google Scholar 

  31. V. P. Srini and J. F. Asenjo, Analysis of Cray-1S architecture,Proc. of the 10th Intl. Symp. on Comp. Archit., Stockholm, Sweden (June 1983).

  32. V. P. Srini and J. F. Asenjo, Architecture analysis using dataflow graphs: Cray-1S as case study, Monograph, Computer Science Department, University of Alabama, Birmingham, Alabama (May 1983).

    Google Scholar 

  33. V. P. Srini, An extended abstract dataflow methodology for designing and modeling reconfigurable systems, Ph.D. Dissertation, Computer Science Department, University of Southwestern Louisiana, Lafayette, Louisiana (July 1980).

    Google Scholar 

Download references

Author information

Author notes

  1. V. P. Srini

    Present address: Lawrence Berkeley Laboratory, University of California, MS 50B-3238, 94720, Berkeley, CA

  2. B. D. Shriver

    Present address: IBM T. J. Watson Research Center, P.O. Box 218, 10598, Yorktown Heights, New York

Authors and Affiliations

  1. Computer Science Department, University of Alabama in Birmingham, 35294, Birmingham, Alabama

    V. P. Srini

  2. Computer Science Department, University of Southwestern Louisiana, 70504, Lafayette, Louisiana

    B. D. Shriver

Authors
  1. V. P. Srini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. B. D. Shriver
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This research was supported in part by the National Science Foundation Grant MCS-82-09400, and by the Texas Instruments Inc., Dallas, Texas under Grant D3151, November 1979.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Srini, V.P., Shriver, B.D. A methodology for designing and modeling reconfigurable systems. International Journal of Computer and Information Sciences 13, 339–394 (1984). https://doi.org/10.1007/BF00991657

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation