• Citer

Improvement of Parallelism in a Finite Buffer Sharing Policy

par Devillers, Raymond ;Louchard, Guy
Référence The Computer journal, 19, 3, page (238-245)
Publication Publié, 1976

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

When parallel processes are linked in producer-consumer pairs and share a finite buffer where every portion is accessible to each process, it appears that a slow consumer may considerably delay the entire system.Using conditional critical sections, Dijkstra has proposed to reserve for each producer-consumer pair the adequate number of portions for a normal working and to dedicate the rest of the buffer to absorb the production peaks of the various pairs. L. W. Cooprider et al. then developed solutions which avoid systematic inspection and only use the now classical synchronisation primitives P and V.The present paper is devoted to the elaboration of solutions which improve parallelism and, when useful, discharge processes of administrative tasks.We have used and compared four synchronising methods to this aim: conditional critical sections, semaphores, path expressions and monitors.