A mini-course on concurrency
References
[1]
D Sanders and J Hartman, "Getting Started with Parallel Programming", Proc. 21st SIGCSE Technical Symp., Washington DC, Feb. 1990, pp. 86-88
[2]
D C Hyde, "A Parallel Processing Course for Undergraduates", Proe. 20th SIGCSE Teeh. Syrup., Louisville, Kentucky, Feb. 1989, pp. 170-173
[3]
R M Butler, R E Eggen and S R Wallace, "Introducing Parallel Processing at the Undergraduate Level", Proc. 19th SIGCSE Tech. Syrup., Atlanta, Georgia, Feb. 1988, pp. 63-67
[4]
C Nevison, "An Undergraduate Parallel Processing Laboratory", Proc. 19th SIGCSE Tech. Symp., Atlanta, Georgia, Feb. 1988, pp. 68-72
[5]
K A Robbins, N R Wagner and D J Wenzel, "Virtual Rings: an introduction to Concurrency", SIGCSE Bulletin, Vol. 21, No. 2, June 1989, pp. 23-28
[6]
A Radensk~, "Can Ada be Used as a Primary Programming Language? Major Problems and their Solutions by Means of Subsets", Proc. 21st SIGCSE Technical Syrup., Washington DC, Feb. 1990, pp. 201-205
[7]
L E Winslow and J E Lang, "Ada in CSI", Proc. 20th SIGCSE Tech. Symp., Louisville, Kentucky, Feb. 1989, pp. 209-212
[8]
A Radensky et al., "Experience with Ada as a First Programming Language", SIGCSE Bulletin, Vol. 20, No. 4, Dec. 1988, pp. 58-61
[9]
B L Kurtz and T H Puckett, "Implementing a Single Classwide Project in Software Engineering Using Ada Tasking for Synchronization and Communication", Proc. 21st SIGCSE Technical Symp., Washington DC, Feb. 1990, pp. 6-11
[10]
M B Feldman, A V Lopes and M Perez, "Small-Ada: Personal Computer Courseware for Studying Concurrent Programming", Proc. 21st SIGCSE Technical Symp., Washington DC, Feb. 1990, pp. 206-211
[11]
H M Deitel, Operating Systems, 2rid edn., Addison- Wesley, 1990
[12]
M Ben-Aft, Principles of Concurrent Programming, Prentice-Hall, 1982
[13]
G Olimpo, "The Robot Brothers: an Environment for Learning Parallel Programming Oriented to Computer Education", Comput. Educ., Vol. 12, No. 1, 1988, pp. 113-118
[14]
M Zimmermann, F Perrenoud and A Schiper, "Understanding Concurrent Programming through Program Animation", Froc. 19th SIOCSE Tech. 5ymp., Atlanta, Georgia, Feb. 1988, pp. 27-31
Index Terms
- A mini-course on concurrency
Recommendations
Semantics-based concurrency control: beyond commutativity
The concurrency of transactions executing on atomic data types can be enhanced through the use of semantic information about operations defined on these types. Hitherto, commutativity of operations has been exploited to provide enchanced concurrency ...
Extracting more concurrency from distributed transactions
OSDI'14: Proceedings of the 11th USENIX conference on Operating Systems Design and ImplementationDistributed storage systems run transactions across machines to ensure serializability. Traditional protocols for distributed transactions are based on two-phase locking (2PL) or optimistic concurrency control (OCC). 2PL serializes transactions as soon ...
Comments
Information & Contributors
Information
Published In
Copyright © 1991 ACM.
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 March 1991
Published in SIGCSE Volume 23, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations5Total Citations
- 312Total Downloads
- Downloads (Last 12 months)65
- Downloads (Last 6 weeks)18
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in