In edge-cloud computing, a set of edge servers are deployed near the mobile devices such
that these devices can offload jobs to the servers with low latency. One fundamental and …

In edge-cloud computing, a set of servers (called edge servers) are deployed near the
mobile devices to allow these devices to offload their jobs to and subsequently obtain their …

The map-reduce paradigm is now standard in industry and academia for processing large-
scale data. In this work, we formalize job scheduling in map-reduce as a novel …

We propose a general dual-fitting technique for analyzing online scheduling algorithms in
the unrelated machines setting where the objective function involves weighted flow-time …

Recently the use of potential functions to analyze online scheduling algorithms has become
popular [19, 7, 29, 13, 31, 4, 30, 3, 21, 15, 14, 28, 12, 2, 5, 6, 9, 11, 23, 33, 24, 8, 17, 16, 25 …

We give a principled method to design online algorithms (for potentially non-linear
problems) using a mathematical programming formulation of the problem, and also to …

In this work, we study the problem of scheduling parallelizable jobs online with an objective
of minimizing average flow time. Each parallel job is modeled as a DAG where each node is …

We consider the classical problem of minimizing the total weighted flow-time for unrelated
machines in the online non-clairvoyant setting. In this problem, a set of jobs J arrive over …

Due to its optimality on a single machine for the problem of minimizing average flow time,
Shortest-Remaining-Processing-Time (SRPT) appears to be the most natural algorithm to …

We study the price of anarchy of coordination mechanisms for a scheduling problem where
each job j has a weight wj, processing time pij, assignment cost hij, and communication …