Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:918660
Jump to:navigation, search

DOI10.1016/0020-0190(90)90149-RzbMath0706.68017OpenAlexW2073174336MaRDI QIDQ918660

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

task allocationdistributed computing systemschain-like tasktask turnaround time


Mathematics Subject Classification ID

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


Related Items (2)

A two-pass approach for optimally assigning linear tasks to multiprocessor systems ⋮ Partitioning multiple-chain-like task across a host-satellite system



Cites Work

  • Multiprocessor Scheduling with the Aid of Network Flow Algorithms


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:918660&oldid=12883940"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:15.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki