Online MapReduce scheduling problem of minimizing the makespan (Q511710): Difference between revisions

@@ Property / DOI @@
-.1007/s10878-015-9982-7
@@ Property / DOI: 10.1007/s10878-015-9982-7 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-015-9982-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2283852572
@@ Property / OpenAlex ID: W2283852572 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling on identical machines: How good is LPT in an on-line setting?
+Normal rank
@@ Property / cites work @@
+A Quicker Convergence to Euler's Constant
@@ Property / cites work: A Quicker Convergence to Euler's Constant / rank @@
+Normal rank
@@ Property / cites work @@
+Online scheduling of parallel jobs with preemption on two identical machines
+Normal rank
@@ Property / cites work @@
+Online makespan minimization in MapReduce-like systems with complex reduce tasks
+Normal rank
@@ Property / cites work @@
+Q3579593
@@ Property / cites work: Q3579593 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10878-015-9982-7
@@ Property / DOI: 10.1007/S10878-015-9982-7 / rank @@
+Normal rank