Efficient allocation of chain-like task on chain-like network computers

DOI10.1016/0020-0190(90)90149-RMaRDI QIDQ918660zbMATH OpenOpenAlexFDO

Authors Jang-Ping Sheu, Zen-Fu Chiang

Publication date 1990

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

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

zbMATH Keywords

chain-like taskdistributed computing systemstask allocationtask turnaround time

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• Task allocation on a network of processors
• Assigning chain-like tasks to a chain-like network
• Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents
• scientific article; zbMATH DE number 1760097
• Distributed algorithms for scheduling on line and tree networks
• Efficient processor allocation strategies for mesh-connected parallel computers
• Task allocation in distributed processing systems

Cites work

• Multiprocessor Scheduling with the Aid of Network Flow Algorithms

Cited in

(6)

• Mapping a chain task to chained processors
• Partitioning multiple-chain-like task across a host-satellite system
• A search algorithm for a rational distribution of computation-logic tasks among the elements of a local computer network
• Assigning chain-like tasks to a chain-like network
• Packet task processing in distributed computational environments with inalienable resources
• A two-pass approach for optimally assigning linear tasks to multiprocessor systems

This page was built for publication: Efficient allocation of chain-like task on chain-like network computers

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