![]() ![]() The process of transforming one abstraction into a more detailed abstraction is called refinement. This process has many underlying techniques of abstraction.Īn abstraction is a model. 1979.The process of establishing the decomposition of a problem into simpler and more understood primitives is basic to science and software engineering. Wyllie J.C.: "The Complexity of Parallel Computations", Ph. Shaw.: "The Logical Design of Operating Systems", Prentice Hall, Englewood Cliffs, N.J. Schwartz.: "Ultracomputers", ACM Transactions on Programming Languages and System, 1980.Ī.C. Ja'Ja'.: Fast Efficient Parallel algorithms for some graph problems", SIAM J. Stearns and Lewis P.M.: "System Level Concurrency Control for Distributed Database Systems", ACM TODS, Vol. Reif J.H.: "On the power of probabilistic choice in synchronous parallel computations", 9th International Colloquium on Automata, Languages and Programming, Aarthus, Denmark, 442–450, July 1982.ĭ.G. Silberchatz.: "Operating System Concepts", Addison-Welsey, 1983. Obermark.: "Distributed Deadlock Detection Algorithm", ACM TODS, Vol. Minoura.: "Deadlock Avoidance Revisited", JACM, Vol. Muntz.: "Locking and Deadlock Detection in Distributed Data Bases", IEEE Trans. Ladner R.E.: "The Circuit value problem is log-space complete for P", SIGACT news 7(1), 18–20 (1975).ĭ. Kameda.: "Testing Deadlock-Freedom of Computer Systems", JACM, Vol. Laaser.: "Complete problems for deterministic polynomial time", Theort. J.Ja'Ja'.: "Parallel Graph Algorithms", Tech. Holt.: "Some Deadlock Properties of Computer Systems", Computing Surveys, Vol. Holt.: "On Deadlock in Computer Systems", Ph.D. Holt.: "Comments on Prevention of Systems Deadlocks", CACM, Vol. Habermann.: "Prevention of System Deadlock", CACM, Vol. Staples.: "The maximum flow problem is log-space complete for P", Theoretical Computer Science, 21 105–111, 1982.Ī.N. Gold.: "Deadlock Prediction: Easy and Difficult Cases", Vol. Shattuck.: "On Deadlock Detection in Distributed Systems", IEEE Trans. on Theory of Computing, Boston M.A., April 1983. Tompa.: "Speedups of determinstic machines by synchronous parallel machines", Proc. Reiss.: "Linear Programming is log-space hard for P", Information Processing Lett. Dijkstra.: "Solution of a Problem in Concurrent Programming Control", CACM, Vol. Denning.: "Operating Systems Theory" Prentice-Hall, Englewood Cliffs, New Jersey, 1973.Į.W. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |