Skip to main content

Design of Highly Decentralized Operating Systems

  • Conference paper
Distributed Operating Systems

Part of the book series: NATO ASI Series ((NATO ASI F,volume 28))

  • 122 Accesses

Abstract

In the decentralized operating system approach all the resources of a distributed system are considered as belonging to a single, very reliable, machine. To fully exploit the high potential for performance of such a machine, we need a methodology able to express high parallelism in resource management policies. Also recovery policies should be expressed without constraining real parallelism.

The proposed solution is based upon the definition of a concurrent language and of the corresponding programming environment. The language supports the integration of concurrency and fault tolerance through the optimistic approach to process synchronization.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baiardi, A. Fantechi, M. Vanneschi, “Language Constructs for a Robust Distributed Environment”, Int. Rep., Dept. of Comp. Science S-81-9, Univ. of Pisa, May 1981.

    Google Scholar 

  2. F. Baiardi, A. Fantechi, A. Tomasi, M. Vanneschi, “Mechanisms for a Robust Multiprocessing Environment in the MuTEAM Kernel”, Proc. of 11th Fault Tolerant Computing Symp., Portland (USA), June 1981, pp. 20–24.

    Google Scholar 

  3. F. Baiardi, L. Ricci, M. Vanneschi, “Static Checking of Interprocess Communication in ECSP”, ACM SIGPLAN Symposium on Compiler Construction, Montreal, June 1984.

    Google Scholar 

  4. F. Baiardi, A. Fantechi, A. Tomasi, M. Vanneschi, “Distributed Implementation of Nested Communicating Processes and Termination’,13th Int. Conf. on Parallel Processing, Aug. 1984.

    Google Scholar 

  5. F. Baiardi, L. Ricci, A. Tomasi, M. Vanneschi, “Structuring Processes for a Cooperative Approach to Fault-Tolerant Distributed Software”, Proc. of 4th Symp. on Reliability in Distributed Software and Database Systems, Oct 1984.

    Google Scholar 

  6. F. Baiardi, N. De Francesco, G. Vaglini, “Development of a Debugger for a Concurrent Language”. IEEE TSE, April 1986.

    Google Scholar 

  7. A. J. Bernstein, : “Output Guards and Nondeterminism in Communicating Sequential Processes”, TOPLAS, vol. n. 2, pp. 234–238, April 1980.

    Google Scholar 

  8. D. Bjørner, “Formal Development of Compilers and Interpreters”, Int. Comp. Symposium’ 77, North Holland, pp. 1–21.

    Google Scholar 

  9. S.D. Brookes, C.A.R. Hoare and A.W. Roscoe: “A Theory of Communicating Sequential Processes”, JACM, vol. 31, n. 3, pp. 560–599, July 1984.

    Article  MathSciNet  MATH  Google Scholar 

  10. R.E.Bryant, J.B. Dennis “Concurrent Programming”, MIT Report, 1978.

    Google Scholar 

  11. P. J. Denning,“Fault tolerant operating systems”, ACM Computing Surveys, vol. 8, n.4, Dec. 1976, pp. 359–389.

    Article  MATH  Google Scholar 

  12. DOD, “Reference Manual for the Ada Programming Language”, ANSI MIL-STD 1815A, 1983.

    Google Scholar 

  13. J.A. Feldmann “High Level Programming Language for Distributed Computing”, CACM, vol.22, n.6, June 1979, pp. 353–368.

    Google Scholar 

  14. N. Francez, C.A.R. Hoare, D. J. Lehmann, and W.P. de Roever, “Semantics of Nondeterminism, Concurrency, and Communication”, JCSS, vol. 19, 1979, pp.290–308.

    MATH  Google Scholar 

  15. C.A.R. Hoare, “Communicating Sequential Processes”, CACM, vol. 21, n. 8, Aug. 1978, pp. 666–677.

    MATH  Google Scholar 

  16. C.A.R. Hoare, “A Calculus for Total Correctness of Communicating Processes”, Science of Computer Programming, vol. 1, pp. 49–72, 1981.

    Article  MathSciNet  MATH  Google Scholar 

  17. Inmos Ldt., “Occam Reference Manual”, Prentice Hall, 1984.

    Google Scholar 

  18. D. Jeffrey, “Virtual Time”, ACM TOPLAS, vol. 7, n.3, July 1985, pp. 404–425.

    Article  MathSciNet  Google Scholar 

  19. E.D. Jensen, “Distributed Control” in “Distributed Systems: an Advanced Course”, (B.W.Lampson ed.), Lect.Notes in Comp. Science, Springer & Verlang, 1981.

    Google Scholar 

  20. E.D. Jensen, “Hardware-Software Relationships in Distributed Systems” in “Distributed Systems: an Advanced Course”, (B.W.Lampson ed.), Lect.Notes in Comp. Science, Springer & Verlang, 1981.

    Google Scholar 

  21. E.D. Jensen, L. Sha, R.F. Rashid, J.D. Northcutt, “Distributed Cooperating Processes and Transactions’, ACM SIGCOMM Symp.,1983.

    Google Scholar 

  22. L. Lamport, “Time, Clocks, and the Ordering of Events in a Distributed Systems”. CACM, vol. 21, n. 7, pp. 558–565, July 1978.

    MATH  Google Scholar 

  23. L.Lamport. “Using Time Instead of Timeout for Fault-Tolerant Distributed Systems”. ACM TOPLAS, vol. 6, n.2, April 1984.

    Google Scholar 

  24. B.W. Lampson, H.E. Sturgis, “Crash Recovery in a Distributed Data Storage System”, Xerox Palo Alto Res. Center, Apr. 1979.

    Google Scholar 

  25. G. Levi et al., “Programming Environments: Deriving Language Dependent Tools from Structured Denotational Semantics”, Int. Comp. Symposium ’83, Nurberg, March 1983.

    Google Scholar 

  26. B. Liskov, S.N. Zilles, “Programming with Abstract Data Types”, ACM SIGPLAN Notices, vol.9, n.4, April 1974, pp. 50–59.

    Article  Google Scholar 

  27. B. Liskov and R. Scheifler, “Guardians and Actions: Linguistic Support for Robust, Distributed Programs”. TOPLAS, vol. 5, n. 3, pp. 381–404, July 1983.

    Article  MATH  Google Scholar 

  28. J.E. Moss, “Nested Transactions and Reliable Distribued Computing”, 2nd Symp. on Reliability in Dist. Software and Database Systems, 1981.

    Google Scholar 

  29. D.L. Parnas, “On the Criteria to Be Used in Decomposing Systems Into Modules”, CACM, vol.15, n.l2, Dec. 1972, pp. 1053–1058.

    Google Scholar 

  30. B. Randell, P.A. Lee. P.C. Treleaven, “Reliability Issues in Computer System Design”, ACM Comp. Surveys, vol. 10, n.2, June 1978, pp. 123–165.

    Article  MATH  Google Scholar 

  31. D.P. Reed, “Naming and Synchronization in a Decentralized Computer System”, MIT Technical Rep., TR-205, Sept. 1978.

    Google Scholar 

  32. C.L. Seitz, “Concurrent VLSI architectures”, IEEE TC, Vol. C-33, n. 12, Dec. 1984.

    Google Scholar 

  33. J. Wensley et al., “SIFT: Design and Analisys of a Fault-Tolerant Computer for Aircraft Control”, Proc. IEEE, vol. 66, n.l0, Oct. 1978, pp. 1240–1254.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baiardi, F., Vanneschi, M. (1987). Design of Highly Decentralized Operating Systems. In: Paker, Y., Banatre, JP., Bozyiğit, M. (eds) Distributed Operating Systems. NATO ASI Series, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46604-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46604-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-46606-9

  • Online ISBN: 978-3-642-46604-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics