Runtime Reallocation of Divisible Load under Processor Execution Deadlines

نویسنده

  • Emile Haddad
چکیده

We examine the problem of optimizing the reallocation and execution of divisible load originating in merent amounts at the sites of an interconnected set of heterogeneous processors characterized by their load computing speeds and II0 speeds. Each processor imposes, a priori, a hard deadline on its allocated task completion. The objective of load retasking and redistribution, which is implemented at runtime, is twofold: to prescribe feasible load allocations, and to minimize the job execution completion time. We present the necessary and st@cient conditions for the existence of feasible reallocations, and for a feasible reallocation to be optimal in the sense of minimum completion time. When task completions of an optimal reallocation occur before the specified processor deadlines, the deadlines can be advanced by the amount of laxity to obtain the tightest deadlines.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling Divisible Loads to Optimize the Computation Time and Cost

Efficient load distribution plays an important role in grid and cloud applications. In a typical problem, a divisible load should be split into parts and allocated to several processors, with one processor responsible for the data transfer. Since processors have different speed and cost characteristics, selecting the processors order for the transmission and defining the chunk sizes affect the ...

متن کامل

Impact of PCI-Bus Load on Applications in a PC Architecture

Any data exchanged between the processor and main memory uses the memory bus, sharing it with data exchanged between I/O devices and main memory. If the processor and a device try to transfer data at the same time, an impact can be seen on the processor as well as on the device. As a result, the execution time of an application on the processor may increase due to the memory-bus load generated ...

متن کامل

On Trading Task Reallocation for Thread Management in Multiprocessors

Most general-purpose multiprocessors are time-shared among multiple users. When a user arrives, s/he requests a submachine of size appropriate to his/her computation ; the processor-allocation algorithm then assigns him/her a portion of the multi-processor of the requested size. This study is motivated by the fact that, as successive users arrive, use a portion of the multi-processor, and depar...

متن کامل

Locality-Conscious Load Balancing: Connectionist Architectural Support

Traditionally, in distributed memory architectures, locality maintenance and load balancing are seen as user level activities involving compiler and runtime system support in software. Such software solutions require an explicit phase of execution, requiring the application to suspend its activities. This paper presents the rst (to our knowledge) architecture-level scheme for extracting localit...

متن کامل

HeVac: A Heterogeneous Vacation Scheme for Thermal-Aware Multicore Packet Processing

As processor power density increases, thermal and power control becomes critical for packet processing. Network applications feature ON/OFF execution pattern, which causes frequent temperature and power consumption changes in the processor. In this paper, we propose a novel power aware thermal management algorithm, which achieves power saving in multicore processors by employing a vacation sche...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001