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

Mapping a chain task to chained processors

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

DOI10.1016/0020-0190(92)90054-YzbMath0759.68027WikidataQ127226932 ScholiaQ127226932MaRDI QIDQ1205718

S. Singh

Publication date: 1 April 1993

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


zbMATH Keywords

parallel processingtask schedulingtask allocationtask mappinglinear processor array


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)


Related Items (3)

Efficient array partitioning ⋮ New approximation algorithm for RTILE problem. ⋮ Load-balancing spatially located computations using rectangular partitions




This page was built for publication: Mapping a chain task to chained processors

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1205718&oldid=13273213"
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 07:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki