Skip to search formSkip to main contentSkip to account menu

Producer–consumer problem

Known as: Producer-consumer problem, Producers-consumers problem, Producer-consumer 
In computing, the producer–consumer problem (also known as the bounded-buffer problem) is a classic example of a multi-process synchronization… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Channel (programming)Critical sectionDeadlockDisruptor (software)

Broader (1)

Concurrency (computer science)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Deconstructing the Producer-Consumer Problem with Bus
Many statisticians would agree that, had it not been for DHTs, the improvement of DHCP might never have occurred. In this… 
2018
2018
A Novel Register Renaming Technique for Out-of-Order Processors
Modern superscalar processors support a large number of in-flight instructions, which requires sizeable register files… 
2013
2013
Investigating the Dynamics of Canonical Flux Tubes
Observations indicate that the dynamics of plasmas in our cosmos, the heliosphere, and terrestrial experiments can involve… 
Review
2012
Review
2012
GPU acceleration towards real-time image reconstruction in 3D tomographic diffractive microscopy
Phase microscopy techniques regained interest in allowing for the observation of unprepared specimens with excellent temporal… 
2010
2010
Rule-based validation of SLA choreographies
For the Service Economy to prosper, IT-based Service Markets are required to perform certain business actions autonomically and… 
2010
2010
Aggregation patterns of service level agreements
IT-based Service Markets require an enabling infrastructure to support Service Value Chains and service choreographies resulting… 
2009
2009
Implementing and Testing Producer-Consumer Problem Using Aspect-Oriented Programming
Producer-Consumer problem is a classical and representative synchronization problem in the field of computer science, which can… 
2001
2001
Loop fusion and temporal common subexpression elimination in window-based loops
This paper describes a system for compiling codes written in a conventional high-level language to recon gurable FPGA-based… 
1995
1995
Boosting the performance of hybrid snooping cache protocols
  • F. Dahlgren
  • Proceedings 22nd Annual International Symposium…
  • 1995
  • Corpus ID: 12837856
Previous studies of bus-based shared-memory multiprocessors have shown hybrid write-invalidate/write-update snooping protocols to… 
1991
1991
Reduced Labelled Transition Systems Save Verification Effort
A new method for reducing the amount of effort in the verification of Basic Lotos specifications is presented. The method is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)