An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system

DOI10.1016/S0166-218X(99)00014-1zbMath0932.68001MaRDI QIDQ1293189

Jacques Carlier, Jean-Paul Boufflet

Publication date: 28 June 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

makespanmaster slave bus oriented multiprocessor system

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Computer system organization (68M99)

Related Items (1)

Optimum divisible load scheduling on heterogeneous stars with limited memory

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling multiprocessor tasks -- An overview
• Distributed processing of divisible jobs with communication startup costs
• Décomposition d'une application sur une architecture bus : propriétés des ordonnancements optimaux

This page was built for publication: An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system