Greedy multiprocessor server scheduling
نویسندگان
چکیده
منابع مشابه
Greedy multiprocessor server scheduling
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the `p norms of weighted flow time onm identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.
متن کاملAn unfair semi-greedy real-time multiprocessor scheduling algorithm
Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule results in a large number of scheduling overheads, which affect the practicality of the algorith...
متن کاملScheduling and Data Distribution in a Multiprocessor Video Server
A. L. Narasimha Reddy IBM Almaden Research Center 650 Harry Road San Jose, CA 95120. [email protected] Abstract In this paper, we will address the problem of distributing and scheduling movies on a multiprocessor video server. We will also address the issue of scheduling communication over the multiprocessor switch for the playback of the scheduled movies. A solution is proposed in this pap...
متن کاملElectronic Commerce Multiprocessor Server
In this paper, the performance of an Electronic Commerce server, i.e. a system running Electronic Commerce applications, is evaluated in the case of shared-bus multiprocessor architecture. In particular, we focused on the memory subsystem design. We have analyzed the common case of a system using the MESI coherence protocol, for maintaining coherency among the processor private caches. We have ...
متن کاملMultiprocessor Scheduling
ing and non-profit use of the material is permitted with credit to the source. Statements and opinions expressed in the chapters are these of the individual contributors and not necessarily those of the editors or publisher. No responsibility is accepted for the accuracy of information contained in the published articles. Publisher assumes no responsibility liability for any damage or injury to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2006
ISSN: 0167-6377
DOI: 10.1016/j.orl.2005.07.005