skip to main content
article

Modeling VP operation: the Diwali Festival Problem

Published: 01 April 2005 Publication History

Abstract

A new higher-level synchronization problem called Diwali Festival Problem (DFP) is presented. The problem captures the requirements for implementing the VP operation for semaphores outside the operating system kernel in presence of P and V operations, and shared variables with atomic reads and writes.

References

[1]
K. C. Tai and Richard H. Carver. VP: A new operation for semaphores. ACM Operating Systems Review, 30(3):5--11, 1996.
[2]
Richard J. Lipton. Reduction: A method for proving properties of parallel programs. Communications of the ACM, 18(12):717--721, 1975.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGOPS Operating Systems Review
ACM SIGOPS Operating Systems Review  Volume 39, Issue 2
April 2005
93 pages
ISSN:0163-5980
DOI:10.1145/1055218
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 2005
Published in SIGOPS Volume 39, Issue 2

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 256
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media