Scheduling inverse trees under the communication model of the LogP-machine (Q1285579): Difference between revisions

@@ Property / cites work @@
+Q4091421
@@ Property / cites work: Q4091421 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints
+Normal rank
@@ Property / cites work @@
+C.P.M. Scheduling with Small Communication Delays and Task Duplication
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Three, four, five, six, or the complexity of scheduling with communication delays
+Normal rank
@@ Property / cites work @@
+Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
+Normal rank
@@ Property / cites work @@
+Q4385522
@@ Property / cites work: Q4385522 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing of a Single Machine Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+The Complexity of Scheduling Trees with Communication Delays
+Normal rank
@@ Property / cites work @@
+Towards an Architecture-Independent Analysis of Parallel Algorithms
+Normal rank
@@ Property / cites work @@
+Q3994933
@@ Property / cites work: Q3994933 / rank @@
+Normal rank