On scheduling \textsc{DAGs} for volatile computing platforms: area-maximizing schedules (Q456005): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jpdc.2012.06.007
+Normal rank
@@ Property / OpenAlex ID @@
+W2080162665
@@ Property / OpenAlex ID: W2080162665 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Linear Ordering
@@ Property / cites work: Optimal Linear Ordering / rank @@
+Normal rank
@@ Property / cites work @@
+Extending IC-scheduling via the sweep algorithm
@@ Property / cites work: Extending IC-scheduling via the sweep algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On clustering \textsc{Dag}s for task-hungry computing platforms
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q5699657
@@ Property / cites work: Q5699657 / rank @@
+Normal rank