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

Efficient processor allocation strategies for mesh-connected parallel computers

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

DOI10.1016/0743-7315(92)90016-GzbMath0786.68016OpenAlexW1976008287MaRDI QIDQ1208583

Yahui Zhu

Publication date: 16 May 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(92)90016-g


zbMATH Keywords

parallel architecturesmesh-connected multiprocessor systemprocessor allocation problem


Mathematics Subject Classification ID

Computer system organization (68M99)


Related Items (4)

Fault-tolerance schemes for clusterheads in clustered mesh networks ⋮ Communication-aware processor allocation for supercomputers: Finding point sets of small average distance ⋮ ON DYNAMIC TASK SCHEDULING FOR FPGA-BASED SYSTEMS ⋮ Scheduling independent jobs for torus connected networks with/without link contention.







This page was built for publication: Efficient processor allocation strategies for mesh-connected parallel computers

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