Annals of Operations Research

, Volume 7, Issue 1, pp 295–340 | Cite as

Chapter 9 Distributed systems

Part III Computer Scheduling And System Performance Failures
  • 45 Downloads

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    V. Ahuja, Algorithm to check network states for deadlock, IBM J. Res. Develop. 23, 1 (1979)82–86.Google Scholar
  2. [2]
    V. Ahuja, Determining deadlock exposure for a class of store and forward communication networks, IBM J. Res. Develop 24, 1 (1980)49–55.Google Scholar
  3. [3]
    P.M.G. Apers, A.H. Hevner and S.B. Yao, Optimization algorithms for distributed queries, IEEE Trans. Software Eng., SE-9, No. 1 (1983)57–67.Google Scholar
  4. [4]
    P.A. Bernstein, N. Goodman, E. Wong, C.L. Reeve and J.B. Rothnie, Query processing in a system for distributed databases (SDD-1). ACM Trans. Database Syst. 6, No. 4 (1981)602–625.CrossRefGoogle Scholar
  5. [5]
    J. Blazewicz and D.P. Bovet, Detection and avoidance of deadlock in store and forward communication networks, in:Performance 81, F.J. Kylstra, ed. (North-Holland, 1981) pp. 503–510.Google Scholar
  6. [6]
    J. Blazewicz, D.P. Bovet and G. Gambosi, Deadlock resistant flow control procedures for store and forward networks, IEEE Trans. Comm., COM-32, No. 8 (1984)884–887.CrossRefGoogle Scholar
  7. [7]
    J. Błazewicz, J. Brzeziński and G. Gambosi, Time-stamps approach to store-and-forward deadlock prevention, IEEE Trans. Comm., to appear.Google Scholar
  8. [8]
    J. Błazewicz, J. Brzeziński and G. Gambosi, Time-stamps approach to prevention of different deadlock types in store-and-forward networks, IEEE Trans. Comm., to appear.Google Scholar
  9. [9]
    W. Cellary and D. Meyer, A simple model of query scheduling in distributed database systems, Information Processing Letters 10, No. 3 (1980)137–147.CrossRefGoogle Scholar
  10. [10]
    W. Cellary and D. Meyer, A multi-query approach to distributed processing in a relational distributed data base management system, in: C. Delobel and W. Litwin, eds.,Distributed Data Bases (North-Holland Pub. Co., Amsterdam, 1980) pp. 99–119.Google Scholar
  11. [11]
    T.Y. Cheung, A method for equijoin queries in distributed relational databases, IEEE Trans. Comput, C-31, No. 8 (1982)746–751.Google Scholar
  12. [12]
    W.W. Chu and P. Hurley, Optimal query processing for distributed database systems, IEEE Trans. Comput. C-31, No. 9 (1982)835–850.Google Scholar
  13. [13]
    D.W. Davies, D.L.A. Barber, W.L. Price and C.M. Solomonides,Computer Networks and Their Protocols (J. Wiley and Sons, New York, 1979).Google Scholar
  14. [14]
    R. Epstein and M.R. Stonebraker, Analysis of distributed database processing strategies, Proc. 6-th Int. Conf. Very Large Databases, Montreal, Canada, 1980, pp. 92–101.Google Scholar
  15. [15]
    R. Epstein, M.R. Stonebraker and E. Wong, Distributed query processing in a relational databases system, in: Proc. ACM SIGMOD, Austin, 1978, pp. 169–180.Google Scholar
  16. [16]
    M.R. Garey, D.S. Johnson and R. Sethi, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Res. 1, No. 2 (1976)117–129.Google Scholar
  17. [17]
    M. Gerla and L. Kleinrock, Flow-control, a comparative study, IEEE Trans. Comm. COM-28, No. 4 (1980)553–574.CrossRefGoogle Scholar
  18. [18]
    M.E. Gold, Deadlock prediction easy and difficult cases, SIAM J. Comp. 7, 3 (1978)320–336.CrossRefGoogle Scholar
  19. [19]
    A.N. Habermann, Prevention of system deadlocks, Comm. ACM 12, No. 7 (1969)373–377.CrossRefGoogle Scholar
  20. [20]
    A.R. Hevner and S.B. Yao, Query processing in distributed database systems, IEEE Trans. Software Eng. SE-5, No. 5 (1979) pp. 177–187.Google Scholar
  21. [21]
    R.C. Holt, Comments on prevention of system deadlocks, Comm. ACM 14, No. 1 (1971)36–38.CrossRefGoogle Scholar
  22. [22]
    G.D. Lakhani and J.S. Wang, Comments on: optimisation algorithms for distributed queries, IEEE Trans. Software Eng. SE-10, No. 4 (1984)464–465.Google Scholar
  23. [23]
    E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).Google Scholar
  24. [24]
    A. Merlin and S. Schweitzer, Deadlock avoidance in store-and-forward networks, I-Store and forward deadlocks, IEEE Trans. Comm., COM-28, No. 3 (1980)345–354.CrossRefGoogle Scholar
  25. [25]
    A. Merlin and S. Schweitzer, Deadlock avoidance in store-and-forward networks, II-Other Deadlock Types, IEEE Trans. Comm. 28, 3 (1980)355–360.CrossRefGoogle Scholar
  26. [26]
    W. Perrizo, A method for processing distributed database queries, IEEE Trans. Software Eng. SE-10, No. 4 (1984)466–471.Google Scholar
  27. [27]
    S. Toueg, The design of deadlock-and-livelock-free packet switching networks, Ph.D. Thesis, Princeton University, 1979.Google Scholar
  28. [28]
    E. Wong, Retrieving dispersed data from SDD-1: A system for distributed databases, in: Proc. 2-nd Berkeley Workshop on Distributed Data Management and Computer Networks, Berkeley, USA, 1977, pp. 217–235.Google Scholar
  29. [29]
    E. Wong and K. Youssefi, Decomposition — a strategy for query processing, ACM Trans. Database Syst. 1, No. 3 (1976)223–241.CrossRefGoogle Scholar

Copyright information

© J. C. Baltzer AG, Scientific Publishing Company 1986

Personalised recommendations