Two Way Concurrent Buffer System without Deadlock in Various Time Models Using Timed Automata
Rohit Mishra, Md Zeeshan, Sanjay Singh

TL;DR
This paper proposes a deadlock-free, time-efficient two-way buffer system using timed automata by introducing delays and a dummy buffer, enhancing concurrency and performance over existing models.
Contribution
It introduces a novel buffer system model with delays and dummy buffers, ensuring deadlock freedom and improved concurrency across various time models.
Findings
The proposed model is deadlock free under various time models.
Introducing delays and dummy buffers enhances concurrency.
Simulation results show improved transfer speed and efficiency.
Abstract
Two way buffer system is a system that exhibits transfer of data using two buffers concurrently. It includes processes that synchronize to exchange data with each other along with executing certain delays between these synchronizations. In existing Tiny Two Way Buffer System, both generators produce packets in half duplex manner in no time, deterministic time, and non deterministic time. Analysis of the model for above time options leads the model in deadlock. The model can be out of the deadlock if timings in the model is incorporated in alternative fashion. The generators produce packets after a delay of 10 seconds. However, generator one has an initial shift of 5 seconds after which it begins sending a packet every 10 seconds. Hence, initial delay for generator one is 15 seconds and for generator two it is 10 seconds. Due to this initial shift, both generators produce packets…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Parallel Computing and Optimization Techniques · Real-Time Systems Scheduling
