Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays (Q1975378): Difference between revisions

@@ Property / cites work @@
+An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
+Normal rank
@@ Property / cites work @@
+Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling UET-UCT series-parallel graphs on two processors
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Scheduling Tasks with Nonuniform Deadlines on Two Processors
+Normal rank
@@ Property / cites work @@
+Q4195940
@@ Property / cites work: Q4195940 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds for Certain Multiprocessing Anomalies
@@ Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Multiprocessing Timing Anomalies
@@ Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Scheduling Trees with Communication Delays
+Normal rank
@@ Property / cites work @@
+UET scheduling with unit interprocessor communication delays
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(99)00211-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2154319383
@@ Property / OpenAlex ID: W2154319383 / rank @@
+Normal rank