Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q58655028, #quickstatements; #temporary_batch_1704605156744 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58655028 / rank | |||
Normal rank |
Revision as of 07:26, 7 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks |
scientific article |
Statements
Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (English)
0 references
8 March 2012
0 references
Summary: We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks. We then prove that there is no heuristic with a performance guarantee smaller than 4/3 for makespan minimization for precedence graph on a large class of processor networks like hypercube, grid, torus, and so forth, with a fixed diameter \(\delta \in \mathbb N\). We extend complexity results when the precedence graph is a bipartite graph. We also design an efficient polynomial-time \(O(\delta^2)\)-approximation algorithm for the makespan minimization on processor networks with diameter \(\delta\).
0 references