Andrews, G.R., and Schneider, F.B. Concepts and notations {or concurrent programming. In Concurrent Programming, N. Gehani and A.D. McGettrick, Eds. Addison-Wesley, Reading, Mass., 1988, pp. 3-69. {First published in Comput. Surv. 15, 1 {Mar. 1983}, 3-43.

Digital Library

Google Scholar

[4]

Baase, S. ComputerAIgorithms. 2d ed. Addison- Wesley, Reading, Mass., 1988.

Google Scholar

[5]

Ben-Ari, M. Principles of Concurrent Programming. Prentice Hall, Englewood Cliffs, N.J., 1982.

Digital Library

Google Scholar

[6]

Bic, L., and Shaw, A.C. The LogicaI Design of Operating Systems. Prentice Hall, Englewood Cliffs, N.J., 1988.

Digital Library

Google Scholar

[7]

Brinch Hansen, P. Operating System PrincipIes. Prentice Hall, Englewood Cliffs, N.J., 1973.

Digital Library

Google Scholar

[8]

Cook, S.A. A taxonomy of problems with fast parallel algorilhms. Inf. and Cont. 64 (1985), 2-22.

Digital Library

Google Scholar

[9]

Deitel, H.M. Operating Systems. 2d ed. Addison- Wesley, Reading, Mass., 1990.

Digital Library

Google Scholar

[10]

Dijkstra, E.W. A DiscipIine of Programming. Prentice Hall, Englewood Cliffs, N.J., 1976.

Digital Library

Google Scholar

[11]

Feldman, J.A., Fanty, M.A., Goddard, N.H., and Lynne, K.J. Computing with structured connectionist networks. Commun. ACM 31, 2 (Feb. 1988), 170-187.

Digital Library

Google Scholar

[12]

Finkel, R.A. Large-Grain Parallelism--Three case studies. In The Characteristics of Parallel Atgorithms, L.H. Jamieson, D.B. Gannon, and R.J. Douglass, Eds. The MIT Press, Cambridge, Mass., 1987, pp. 21-6:}.

Google Scholar

[13]

Finkel, R.A. An Operating Systems VADE MECUM. 2d ed. Prentice Hall, Englewood Cliffs, N.J., 1988.

Digital Library

Google Scholar

[14]

Gehani, N., and McGettrick, A.D., Eds. Concurrent Programming. Addison-Wesley, Reading, Mass., 1988.

Digital Library

Google Scholar

[15]

Harel, D. Algorithmics. Addison-Wesley, Reading, Mass., 1987.

Google Scholar

[16]

Hemmendinger, D. Comments on "A correct and unrestrictive implementation of general semaphores." Oper. Syst. Rer. 23, 1 (Jan. 1989), 7-8.

Digital Library

Google Scholar

[17]

Hoare, C.A.R. Communicating SequentiaI Processes. Prentice Hall, Englewood Cliffs, N.J., 1985.

Digital Library

Google Scholar

[18]

Hoare, C.A.R. Communicating sequential processes. In Concurrent Programming, N. Gehani and A.D. McGettrick, Eds. Addison-Wesley, Reading, Mass., 1988, pp. 278-308. (First published in Commun. ACM 21, 8 (Aug. 1978), 666- 677.)

Digital Library

Google Scholar

[19]

Holt, R.C. Concurrent Euclid, The UNIX System, and TUNIS. Addison-Wesley, Reading, Mass., 1983.

Google Scholar

[20]

Hyman, H. Comments on a problem in concurrent programming control. Commun. ACM 9, 1 (Jan. 1966), 45.

Digital Library

Google Scholar

[21]

Maekawa, M., Oldehoeft, A.E., and Oldehoeft, R.R. Operating Systems: Advanced Concepts. Benjamin/Cummings Publishing Company, Menlo Park, Calif., 1987.

Digital Library

Google Scholar

[22]

Osterhaug, A., Ed. Guide to Parallel Programming on Sequent Computer Systems. 2d ed. Prentice Hall, Englewood Cliffs, N.J., 1989.

Digital Library

Google Scholar

[23]

Owicki, S.S., and Gries, D. An axiomatic proof technique for parallel programs. Acta Inf. 6 (1976), 319-340.

Digital Library

Google Scholar

[24]

Owicki, S.S., and Gries, D. Verifying properties of parallel programs: An axiomatic approach. Commun. ACM 19, 5 (May 1976), 279-285.

Digital Library

Google Scholar

[25]

Padua, D.A., and Wolfe, M.J. Advanced compiler optimizations for supercomputers. Commun. ACM 29, 12 (Dec. 1986), 1184-1201.

Digital Library

Google Scholar

[26]

Peterson, J.L. Petri Net Theory and the Modeling of Systems. Prentice Hall, Englewood Cliffs, N.J., 1981.

Digital Library

Google Scholar

[27]

Polychronopoulos, C.D. Parallel Programming and Compilers. Kluwer Academic Publishers, Boston, Mass., 1988.

Digital Library

Google Scholar

[28]

Quinn, M.J. Designing Efficient Algorithms for Parallel Computers. McGraw-Hill Book Company, New York, 1987.

Digital Library

Google Scholar

[29]

Raynal, M. Algorithms for MutuaI Exclusion. The MIT Press, Cambridge, Mass., 1986.

Digital Library

Google Scholar

[30]

Rumelhart, D.E., and McClelland, J.L., Eds. Parallel Distributed Processing: Explorations in the Microstructure of Cognition. Vol. I, Foundations. MIT Press / Bradford Books, Cambridge, Mass., 1986.

Digital Library

Google Scholar

[31]

Sabot, G.W. The Paralation ModeI. The MIT Press, Cambridge, Mass., 1988.

Google Scholar

[32]

Silberschatz, A., and Peterson, J.L. Operating System Concepts. Addison-Wesley, Reading, Mass., 1988.

Digital Library

Google Scholar

[33]

Ullman, J.D. Principles of Database Systems. 2d ed. Computer Science Press, Inc., Rockville, Md., 1982.

Digital Library

Google Scholar

[34]

Whiddett, D. Concurrent Programming for Software Engineers. Ellis Horwood Ltd., Chichester, Great Britain, 1987.

Digital Library

Google Scholar

[35]

Akl, S.G. The Design and Analysis of Parallel Algorithms. Prentice Hall, Englewood Cliffs, N.J., 1989.

Digital Library

Google Scholar

[36]

Bach, M.J. The Design of the UNIX Operating System. Prentice Hall, Englewood Cliffs, N.J., 1986.

Digital Library

Google Scholar

[37]

Berstein, A.J. Program analysis for parallel processing. IEEE Trans. Elect. Comput. EC-15, 5 (Oct. 1966), 757-762.

Crossref

Google Scholar

[38]

Bustard, D., Elder, J., and Welsh, J. Concurrent Program Structures. Prentice Hall, Englewood Cliffs, N.J., 1988.

Digital Library

Google Scholar

[39]

Chandy, K.M., and Misra, J. Parallel Program Design: A Foundation. Addison-Wesley, Reading, Mass., 1988.

Digital Library

Google Scholar

[40]

Cherry, G.W. Parallel Programming in ANSI Standard Ada. Reston Press, Reston, Va., 1984.

Digital Library

Google Scholar

[41]

Coffman, E.G., and Denning, P.J. Operating Systems Theory. Prentice Hall, Englewood Cliffs, N.J., 1973.

Digital Library

Google Scholar

[42]

Crichlow, J.M. An Introduction to Distributed and Parallel Computing. Prentice Hall, Englewood Cliffs, N.J., 1988.

Digital Library

Google Scholar

[43]

Desrochers, G.R. Principles of Parallel and Multiprocessing. Intertext Publications, Inc., McGraw- Hill Book Company, New York, 1987.

Digital Library

Google Scholar

[44]

Hoare, C.A.R. Monitors: An operating system structuring concept. In Concurrent Programming, N. Gehani and A.D. McGettrick, Eds. Addison- Wesley, Reading, Mass., 1988 pp. 256-277. {First published in Commun. ACM 17, 10 (Oct. 1974), 549-557.)

Digital Library

Google Scholar

[45]

Hsieh, C.S. Further comments on implementation of general semaphores. Oper. Syst. Rev. 23, 1 (Jan. 1989), 9-10.

Digital Library

Google Scholar

[46]

Jamieson, L.H., Gannon, D.B., and Douglass, R.J., Eds. The Characteristics of Parallel Algorithms. The MIT Press, Cambridge, Mass., 1987.

Digital Library

Google Scholar

[47]

Krakowiak, S. Principles of Operating Systems. The MIT Press, Cambridge, Mass., 1988.

Digital Library

Google Scholar

[48]

Lister, A.M. FundamentaIs of Operating Systems. 3d ed. Springer-Verlag, New York, 1984.

Digital Library

Google Scholar

[49]

Lorin, H. ParalIelism in Hardware and Software: Real and Apparent Concurrency. Prentice Hall, Englewood Cliffs, N.J., 1972.

Google Scholar

[50]

Lusk, E., Overbeek, R., et al. Portable Programs for Parallel Processors. Holt, Rinehart and Winston Inc., New York, 1987.

Digital Library

Google Scholar

[51]

Madnick, S.E., and Donovan, J.J. Operating Systems. McGraw-HiI1, New York, 1974.

Digital Library

Google Scholar

[52]

Milenkovic, M. Operating Systems Concepts and Design. McGraw-Hill, New York, 1987.

Digital Library

Google Scholar

[53]

Raynal, M. Distributed Algorithms and Protocols. John Wiley & Sons, New York, 1988.

Digital Library

Google Scholar

[54]

Reed, D.P., and Kanodia, R.K. Synchronization with event counts and sequencers. Commun. ACM 22, 2 (Feb. 1979), 115-123.

Digital Library

Google Scholar

[55]

Theaker, C.J., and Brookes, G.R. A Practical Course on ~perating Systems. Springer-Verlag, New York, 1983.

Google Scholar

[56]

Turner, R.W. Operating Systems Design and ImpIementations. Macmillan, New York, 1986.

Digital Library

Google Scholar

[57]

Yuen, C.K. Essential Concepts of Operating Systems. Addison-Wesley, Reading, Mass., 1986.

Digital Library

Google Scholar

Cited By

View all

Lamport L(2019)The computer science of concurrencyConcurrency10.1145/3335772.3335775(13-26)Online publication date: 4-Oct-2019
https://dl.acm.org/doi/10.1145/3335772.3335775
Lamport L(2015)Turing lectureThe computer science of concurrencyCommunications of the ACM10.1145/277195158:6(71-76)Online publication date: 21-May-2015
https://dl.acm.org/doi/10.1145/2771951
Lien CYang C(1993)Using Extended Timed Petri Nets to evaluate and validate timing performance of hard real‐times softwareJournal of the Chinese Institute of Engineers10.1080/02533839.1993.967749716:2(261-275)Online publication date: Mar-1993
https://doi.org/10.1080/02533839.1993.9677497
Show More Cited By

Index Terms

Self-assessment procedure XXI: a self-assessment procedure on concurrency

Recommendations

Effectiveness of Formative E-assessment Procedure: Learning Calculus In Blended Learning Environment
ICCBN '20: Proceedings of the 2020 8th International Conference on Communications and Broadband Networking

Emergence of new educational technologies is changing the way we learn. Online communication acts as one of the crucial internet applications and assets are widely used in higher education in this millennium era. Due to the pressure to adapt to the ...
Self-Assessment in the REAP Tutor: Knowledge, Interest, Motivation, & Learning

Self-assessment questionnaires have long been used in tutoring systems to help researchers measure and evaluate various aspects of a student's performance during learning activities. In this paper, we chronicle the efforts made in the REAP project, a ...
Self-assessment and task selection in learner-controlled instruction: Differences between effective and ineffective learners

Learner-controlled instruction is often found to be less effective for learning than fixed or adaptive system-controlled instruction. One possible reason for that finding is that students - especially novices - might not able to accurately assess their ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 33, Issue 5

May 1990

104 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/78607

Editor:
Peter J. Denning
NASA Ames Research Center, Moffett Field, CA

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1990

Published in CACM Volume 33, Issue 5

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
751
Total Downloads

Downloads (Last 12 months)105
Downloads (Last 6 weeks)27

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Lamport L(2019)The computer science of concurrencyConcurrency10.1145/3335772.3335775(13-26)Online publication date: 4-Oct-2019
https://dl.acm.org/doi/10.1145/3335772.3335775
Lamport L(2015)Turing lectureThe computer science of concurrencyCommunications of the ACM10.1145/277195158:6(71-76)Online publication date: 21-May-2015
https://dl.acm.org/doi/10.1145/2771951
Lien CYang C(1993)Using Extended Timed Petri Nets to evaluate and validate timing performance of hard real‐times softwareJournal of the Chinese Institute of Engineers10.1080/02533839.1993.967749716:2(261-275)Online publication date: Mar-1993
https://doi.org/10.1080/02533839.1993.9677497
Lamport L(1991)The mutual exclusion problem has been solvedCommunications of the ACM10.1145/99977.27814734:1(110-ff.)Online publication date: 3-Jan-1991
https://dl.acm.org/doi/10.1145/99977.278147
Ashenhurst R(1991)ACM forumCommunications of the ACM10.1145/102792.37604134:2(19-21)Online publication date: 1-Feb-1991
https://dl.acm.org/doi/10.1145/102792.376041

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Effectiveness of Formative E-assessment Procedure: Learning Calculus In Blended Learning Environment

Self-Assessment in the REAP Tutor: Knowledge, Interest, Motivation, & Learning

Self-assessment and task selection in learner-controlled instruction: Differences between effective and ineffective learners

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Share

Share this Publication link

Share on social media

Affiliations