We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobsâ€...
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
—this paper studies the influence that task placement may have on the performance of applications, mainly due to the relationship between communication locality and overhead. Thi...
Javier Navaridas, Jose Antonio Pascual, José...
Abstract. We present an all-optical ring network architecture with logarithmic shortcuts and a systolic routing protocol for it. An r-dimensional optical ring network with logarith...