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

DOI10.1016/0020-0190(93)90089-RMaRDI QIDQ1313732zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Efficient allocation of chain-like task on chain-like network computers
• Assigning chain-like tasks to a chain-like network
• scientific article; zbMATH DE number 3885290
• Efficient algorithms for mapping and partitioning a class of parallel computations
• Mapping a chain task to chained processors

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• Allocating programs containing branches and loops within a multiple processor system
• An efficient algorithm for a task allocation problem
• Critical Load Factors in Two-Processor Distributed Systems
• Efficient allocation of chain-like task on chain-like network computers
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms

Cited in

(1)

• Mapping a chain task to chained processors

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

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