Bounds and approximation for clocked interprocessor communication

DOI10.1007/BF02094328MaRDI QIDQ1197779zbMATHOpenAlexFDO

Authors Jean-Yves Le Boudec, Jacqueline Gianini

Publication date 16 January 1993

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02094328

zbMATH Keywords

priority queueinterprocessor communicationclocked message transfer scheme

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Performance analysis of interprocessor communications in an electronic switching system with distributed control
• An upper and lower bound for clock synchronization
• Bounds and algorithms for a practical task allocation model (extended abstract)
• Time bounds for real-time process control in the presence of timing uncertainty
• A clock synchronization problem with random delays

Cites work

• scientific article; zbMATH DE number 3852171 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• Analysis of a Task Oriented Multipriority Queueing System

Cited in

(2)

• Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times
• Performance analysis of interprocessor communications in an electronic switching system with distributed control

This page was built for publication: Bounds and approximation for clocked interprocessor communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197779)