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

Selection of the first k largest processes in hypercubes

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

DOI10.1016/0167-8191(89)90044-6zbMath0688.68011OpenAlexW1989615856MaRDI QIDQ1263960

Gen-Huey Chen, Chunlien Wu, Jang-Ping Sheu

Publication date: 1989

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: http://ntur.lib.ntu.edu.tw/bitstream/246246/154658/1/05.pdf

zbMATH Keywords

hypercubeselection problemk-selection problem


Mathematics Subject Classification ID

Theory of operating systems (68N25) Theory of software (68N99) Algorithms in computer science (68W99)


Related Items

Efficient parallel k selection algorithm, An algorithm paradigm for incomplete hypercubes, Fault-tolerant parallel \(k\) selection algorithm in \(n\)-cube networks



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