article

Free access

Semaphores outside the kernel

Author:

Jason GaitAuthors Info & Claims

ACM SIGPLAN Notices, Volume 19, Issue 10

Pages 12 - 21

https://doi.org/10.1145/948290.948291

Published: 01 October 1984 Publication History

PDF eReader

Abstract

We present three new implementations of semaphores for V7 UNIX. None require kernel modifications. The canonical UNIX semaphore method uses link O in a spin loop. The first new method replaces the canonical spin loop with a software trap mechanism, the second provides additional enhancements in the form of a pool of semaphores and explicit quene management, and the third is a distributed protocol extending to the ability for synchronizing in network environments.

References

[1]

COMER84 Comer, D., Operating System Design. The XINU Approach, Prentice Hall, Englewood Cliffs NJ, 1984.

Digital Library

Google Scholar

[2]

DIJKSTRA65 Dijkstra, E., Solution of a Problem in Concurrent Programming Control, CACM, 8(1965)569--72.

Digital Library

Google Scholar

[3]

GAIT84 Gait, J., A Probe Effect in Concurrent Programs, Tech Rep CR-84-04, Computer Res Lab, Tektronix, Feb 1984.

Google Scholar

[4]

HANSEN75 Hansen, P., The Programming Language Concurrent Pascal, IEEE Tr. on Softw. Eng., 1(1975)199--207.

Digital Library

Google Scholar

[5]

HANSEN78 Hansen, P., Distributed Processes: A Concurrent Programming Concept, CACM, 21(1978)934--41.

Digital Library

Google Scholar

[6]

HOARE78 Hoare, C., Communicating Sequential Programs, CACM, 21(1978)666--77.

Digital Library

Google Scholar

[7]

HOLT83 Holt, R., Concurrent Euclid, the UNIX System and Tunis, Addison Wesley, Reading Mass, 1983.

Google Scholar

[8]

KERSTEN84 Kersten, M., Tebra, H., Application of an Optimistic Concurrency Control Method, SPAE, 14(1984)153--68.

Google Scholar

[9]

KNUTH66 Knuth, D., A Note on "Solution of a Problem in Concurrent Programming Control", CACM, 9(1966)321--2.

Digital Library

Google Scholar

[10]

LAMPSON79 Lampson, B., Redell, D., Experience With Processes and Monitors in Mesa, Proc 7th Symp on Oper Sys Prin, Dec 1979, Asilomar Calif, 43--4.

Digital Library

Google Scholar

[11]

LEF84 Lee, J., File Locking Under Unix, net.unix-wizards, Message ID <[email protected]>, June 1984.

Google Scholar

[12]

LEWIS82 Lewis, T., Software Engineering Analysis and Verification, Reston Pub, Reston Va, 1982.

Digital Library

Google Scholar

[13]

LISTER79 Lister, A., Fundamentals of Operating Systems, Springer-Verl, New York, 1979.

Digital Library

Google Scholar

[14]

RICART81 Ricart, G., Agrawala, A., An Optimal Algorithm for Mutual Exclusion in Computer Networks, CACM, 24(1981)9--17.

Digital Library

Google Scholar

Cited By

View all

Gait J(1987)Distributed process manager for an engineering network computerJournal of Parallel and Distributed Computing10.1016/0743-7315(87)90028-14:4(423-437)Online publication date: 1-Aug-1987
https://dl.acm.org/doi/10.1016/0743-7315%2887%2990028-1
Janssens MAnnot JVan De Goor A(1986)Adapting UNIX for a multiprocessor environmentCommunications of the ACM10.1145/6592.659829:9(895-901)Online publication date: 1-Sep-1986
https://dl.acm.org/doi/10.1145/6592.6598
Gait J(1986)A probe effect in concurrent programsSoftware—Practice & Experience10.1002/spe.438016030416:3(225-233)Online publication date: 1-Mar-1986
https://dl.acm.org/doi/10.1002/spe.4380160304
Show More Cited By

Recommendations

WFR-TM

Transactional Memory (TM) is a promising concurrent programming paradigm which employs transactions to achieve synchronization in accessing common data known as transactional variables. A transaction may either commit, making its updates to ...
Extensible software transactional memory
C3S2E '10: Proceedings of the Third C* Conference on Computer Science and Software Engineering

XSTM is a software transactional memory that can be extended by pluggable components. Extensions can access transactions read and write sets through an API, and process them e.g., for logging, change notification, state persistence or replication. This ...
Relativistic red-black trees

This paper presents algorithms for concurrently reading and modifying a red-black tree RBTree. The algorithms allow wait-free, linearly scalable lookups in the presence of concurrent inserts and deletes. They have deterministic response times for a ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 19, Issue 10

October 1984

51 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/948290

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1984

Published in SIGPLAN Volume 19, Issue 10

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
252
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)4

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gait J(1987)Distributed process manager for an engineering network computerJournal of Parallel and Distributed Computing10.1016/0743-7315(87)90028-14:4(423-437)Online publication date: 1-Aug-1987
https://dl.acm.org/doi/10.1016/0743-7315%2887%2990028-1
Janssens MAnnot JVan De Goor A(1986)Adapting UNIX for a multiprocessor environmentCommunications of the ACM10.1145/6592.659829:9(895-901)Online publication date: 1-Sep-1986
https://dl.acm.org/doi/10.1145/6592.6598
Gait J(1986)A probe effect in concurrent programsSoftware—Practice & Experience10.1002/spe.438016030416:3(225-233)Online publication date: 1-Mar-1986
https://dl.acm.org/doi/10.1002/spe.4380160304
Kilian M(1985)A conditional critical region pre-processor for C based on the Owicki and Gries schemeACM SIGPLAN Notices10.1145/988316.98832120:4(42-56)Online publication date: 1-Apr-1985
https://dl.acm.org/doi/10.1145/988316.988321

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

Recommendations

WFR-TM

Extensible software transactional memory

Relativistic red-black trees

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations