This paper considers the minimization of makespan for a set dependent tasks with unit duration and communication delays. Given an upper bound makespan, release dates deadlines can be computed. Time windows are defined accordingly. We prove that our scheduling problem is fixed-parameter tractable; parameter maximum number schedulable at same time considering windows.A algorithm based on dynamic ...

Binary exponential backoff (BEB) is a decades -old algorithm for coordinating access to shared channel. In modern networks, BEB plays crucial role in WiFi and other wireless communication standards. Despite this track record, well-known theoretical results indicate that under bursty traffic, yields poor makespan, superior algorithms are possible. To date, the degree which these findings impact ...

Abstract Private and public clouds are good means for getting on-demand intensive computing resources. In such a context, selecting the most appropriate virtual machines (VMs) is complex task. From user’s point of view, challenge consists in efficiently managing cloud resources while integrating prices performance criteria. This paper focuses on problem VMs to run bags-of-tasks (BoT): big sets ...

Abstract In the classic minimum makespan scheduling problem, we are given an input sequence of n jobs with sizes. A algorithm has to assign m parallel machines. The objective is minimize makespan, which time it takes until all processed. this paper, consider online algorithms without preemption. However, allow change assignment up k at end for some limited number . For identical machines, Alber...