Performance evaluation of fork and join synchronization primitives
From MaRDI portal
DOI10.1007/BF00263293zbMATH Open0625.68025MaRDI QIDQ579922FDOQ579922
Authors: Andrzej Duda, Tadeusz Czachórski
Publication date: 1987
Published in: Acta Informatica (Search for Journal in Brave)
Recommendations
- Analysis of the fork-join queue
- Performability Analysis of Fork-join Queueing Systems
- Analysis of a fork/join station with inputs from a finite population subnetwork with multi-server stations
- scientific article; zbMATH DE number 148327
- The fork-join queue and related systems with synchronization constraints: stochastic ordering and computable bounds
distributed systemsqueueing modelsFork-join queueing networksparallel executionparallel programsperformance modelprocessorsSynchronization
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)
Cited In (4)
- A fork-join queueing model: Diffusion approximation, integral representations and asymptotics
- Approximate analysis of a closed fork/join model
- Some models for developmental systems Part XIV. Parallelism with applications to developmental systems and to queueing systems
- Title not available (Why is that?)
This page was built for publication: Performance evaluation of fork and join synchronization primitives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579922)