Database Paper Browser

Back to papers

Job Scheduling with Minimizing Data Communication Costs

Summary: Proposes data-aware scheduling of interdependent jobs to minimize makespan under data-communication costs in distributed file systems like HDFS. Evaluates algorithms that trade data locality for parallelism while honoring input dependencies in query plans. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5091
Venue
SIGMOD
Year
2015
Pagerank
-
Overall Rank
13,380 | 6.92%
DOI
10.1145/2723372.2764943

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers