Partitioning multiple-chain-like task across a host-satellite system

DOI10.1016/0020-0190(93)90089-RzbMath0787.68008OpenAlexW1963669443MaRDI QIDQ1313732

Alain Billionnet

Publication date: 24 February 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(93)90089-r

zbMATH Keywords

dynamic programmingtime complexitytask allocationpipelininghost-satellite system

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Efficient allocation of chain-like task on chain-like network computers
• Allocating programs containing branches and loops within a multiple processor system
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• Critical Load Factors in Two-Processor Distributed Systems
• An efficient algorithm for a task allocation problem

This page was built for publication: Partitioning multiple-chain-like task across a host-satellite system