Abstract
As small machines proliferate and more and more information is kept in digital form, the desire to share that information will correspondingly increase. This desire, together with the architectural plans of many office automation vendors to provide their products in the form of multiple machines networked together, insures that distributed systems will become increasingly important. While compatibility with the past has been a terrible sword hanging over the heads of major mainframe manufacturers, it may be an even more binding force in some respects in the distributed system market, especially those segments where multiple vendors are involved. It is often more difficult to motivate and coordinate change in a marketplace than within a single, albeit large, company.
Therefore, proper consideration of the kind of issues raised in this discussion is all the more important.
This research was supported in part by ARPA Research Contract DSS MDA-903-77-C--0211.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Alsberg, P. A., Day, J. D., A Principle for Resilient Sharing of Distributed Resources, Second International Conference on Software Engineering, San Francisco, California, October 13–15, 1976, pp. 562–570. 〈primary copy reference〉
Bernstein, P., and N. Goodman, Fundamental Algorithms for Concurrency Control in Distributed Database Systems, Technical Report CCA-80-05, Computer Corporation of America, February 1980.
Cheatham, T., Private communication 1971.
Clark, D., K. Pogran, and D. Reed, An Introduction to Local Area Networks, Proceedings of the IEEE, Vol. 66, No. 11, November, 1978, pp. 1497–1517.
Faissol, S., Availability and Reliability Issues in Distributed Databases, Ph.D. Dissertation, Computer Science Department, University of California, Los Angeles, 1981 (forthcoming).
Gray, J., Minimizing the Number of Messages in Commit Protocols, position paper for ACM Workshop on Fundamental Issues in Distributed Computing, Fallbrook, California, December 15–17, 1980.
Gray, J., Notes on Database Operating Systems, in Operating Systems: An Advanced Course, Vol 60 of Lecture Notes in Computer Science, Springer-Verlag, (1978), pp. 393–481.
Hammer, M. and D. Shipman, An Overview of Reliability Mechanism for a Distributed Data Base System, Spring Compcon 78, February 28–March 3, 1978, pp. 63–65.
Holler, E., The National Software Works, in Lecture Notes in Computer Science: Distributed Systems, B. Lampson, ed., Springer-Verlag, NY, 1981, pp. 421–445.
Holt, R.C., Some Deadlock Properties of Computer System, ACM Computing Surveys, Vol. 4, No. 3, September 1972, pp. 179–196.
Kleinrock, L., Opderbeck, H., Throughput in the Arpanet — Protocols and Measurement Fourth Data Communications Symposium, Quebec City, Canada, October 7–9, 1975, pp. 6–1 to 6–11.
Kung, H.T. and J.R. Robinson, On Optimistic Methods for Concurrency Control, proc., 5th VLDB Conference, October 1979, Rio de Janeiro.
Lampson, B., and H. Sturgis, Crash Recovery in a Distributed Data Storage System, working paper, Xerox PARC, Nov 1976.
Lampson, B., Private Communication, 1979.
Lindsay, B., et al, Notes on Distributed Databases, IBM Research Report, San Jose Laboratory, 1979.
Menasce, D.A. and R.R. Muntz, Locking and Deadlock Detection in Distributed Databases, IEEE Transactions on Software Engineering.
Mockapetris, P. V., Lyle, M.R., Farber, D.J., On the Design of Local Network Interfaces, Proceedings of IFIP Congress '77, Toronto, August 8–12, 1977, pp. 427–430.
Parker, S., G. Popek, et. al., Detection of Mutual Inconsistency of Distributed Systems, accepted for publication in IEE Transactions on Software Engineering.
Rashid, R., and P. Hibbard, Research into loosely-coupled Distributed Systems at CMU, Notes from IEE Workshop on Fundamental Issues in Distributed Systems, Pala Mesa, Ca., Dec 15–17, 1980.
Rudisin, G., Reliability and Recovery Methods for Partitioned, Distributed File Systems, Ph.D., Dissertation, Computer Science Department, University of California, Los Angeles, 1981 (forthcoming).
Saltzer, J., Research Problems of Decentralized Systems with largely Autonomous Nodes, in Operating Systems: An Advanced Course, Vol 60 of Lecture Notes in Computer Science, Springer-Verlag, (1978), pp. 583–591.
Saltzer, J., D. Reed, and D. Clark, End-to-End Arguments in System Design, Notes from IEEE Workshop on Fundamental Issues in Distributed Systems, Pala Mesa, Ca., Dec 15–17, 1980.
Swinehart, D., G. McDaniel, D. Boggs, WFS: A Simple Shared File System for a Distributed Environment, Proceedings of the Seventh Symposium on Operating Systems Principles, Dec 10–12, 1979, Asilomar, Ca. pp 9–17.
Thomas, R.F., A Solution to the Concurrency Control Problem for Multiple Copy Data Bases, Proc. Spring Compcon, Feb 28–Mar 3, 1978, pp. 56–62.
Wilkes, M., and R. Needham, The Cambridge Model Distributed System, Notes from IEEE Workshop on Fundamental Issues in Distributed Systems, Pala Mesa, Ca., Dec 15–17, 1980.
Xerox, The Ethernet: A Local Area Network — Data Link Layer and Physical Layer Specifications, Version 1.0, Sept 30, 1980. Available from Digital Equipment Corporation, Maynard, Massachusetts; Intel Corporation, Santa Clara, California; Xerox Corporation, Stamford, Connecticut.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Popek, G.J. (1981). Notes on distributed systems of microprocessors. In: Flynn, M.J., Harris, N.R., McCarthy, D.P. (eds) Microcomputer System Design. Lecture Notes in Computer Science, vol 126. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11172-7_9
Download citation
DOI: https://doi.org/10.1007/3-540-11172-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11172-6
Online ISBN: 978-3-540-38949-1
eBook Packages: Springer Book Archive