Optimal online algorithms for MapReduce scheduling on two uniform machines (Q2329682): Difference between revisions

@@ Property / DOI @@
-.1007/s11590-018-01384-8
@@ Property / DOI: 10.1007/s11590-018-01384-8 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-018-01384-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2909876918
@@ Property / OpenAlex ID: W2909876918 / rank @@
+Normal rank
@@ Property / cites work @@
+Online MapReduce scheduling problem of minimizing the makespan
+Normal rank
@@ Property / cites work @@
+Randomized on-line scheduling on two uniform machines
+Normal rank
@@ Property / cites work @@
+Online MapReduce processing on two identical parallel machines
+Normal rank
@@ Property / cites work @@
+An Optimal Preemptive Algorithm for Online MapReduce Scheduling on Two Parallel Machines
+Normal rank
@@ Property / cites work @@
+Online makespan minimization in MapReduce-like systems with complex reduce tasks
+Normal rank
@@ Property / cites work @@
+Preemptive on-line scheduling for two uniform processors
+Normal rank
@@ Property / DOI @@
+.1007/S11590-018-01384-8
@@ Property / DOI: 10.1007/S11590-018-01384-8 / rank @@
+Normal rank