6 citations found. Retrieving documents...
E. Frachtenberg, D. Feitelson, F. Petrini, J. Fernandez, Flexible coscheduling: mitigating load imbalance and improving utilization of heterogeneous resources, in: Procedings of the International Parallel and Distributed Processing Symposium (IPDPS03), 2003.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Parallel Job Scheduling Under Dynamic Workloads - Eitan Frachtenberg Dror (2003)   (1 citation)  Self-citation (Frachtenberg Feitelson Petrini Fernandez)   (Correct)

No context found.

Eitan Frachtenberg, Dror Feitelson, Fabrizio Petrini, and Juan Fernandez. Flexible CoScheduling: Mitigating load imbalance and improving utilization of heterogeneous resources. In 17th International Parallel and Distributed Processing Symposium, April 2003. 17


Paired Gang Scheduling - Wiseman, Feitelson (2001)   Self-citation (Feitelson)   (Correct)

....version appeared in JPDPS 2001. Research supported by a Lady Davis Fellowship. with this approach is fragmentation: processors may be left idle if nothing is assigned to them in a certain slot. Several ideas for relaxations of gang scheduling that reduce this waste have therefore been proposed [11, 7, 22, 1]. Our work is also a relaxation of strict gang scheduling, which is called Paired Gang Scheduling [23] All of these improvements remove the requirement that all processes of a given job always run simultaneously on different nodes. There are also other types of improvements, e.g. the use of ....

....that this is achieved by a very simple device, based on data easily available directly to the scheduler. This distinguishes paired gang scheduling from other flexible gang scheduling schemes that are based on monitoring communication in order to deduce the characteristics of parallel jobs (e.g. [11, 7, 22, 1]) The idea can be extended if there are more I O devices in the system. One I O operation won t interfere with other I O operation, so a group of N 1 gangs can be dispatched, where N is the number of I O devices in the system. In particular, it is possible to overlap disk I O with ....

Frachtenberg E., Feitelson D. G., Petrini F. and Fernandez J., Flexible CoScheduling: mitigating load imbalance and improving utilization of heterogeneous resources, 17th Intl. Parallel & Distributed Processing Symp., Apr 2003.


Performance Evaluation 60 (2005) 5--29 - Token-Ordered Lru An   (Correct)

No context found.

E. Frachtenberg, D. Feitelson, F. Petrini, J. Fernandez, Flexible coscheduling: mitigating load imbalance and improving utilization of heterogeneous resources, in: Procedings of the International Parallel and Distributed Processing Symposium (IPDPS03), 2003.


Loosely Coordinated Coscheduling In The Context Of . . . - Sodan (2005)   (Correct)

No context found.

Frachtenberg E, Feitelson D, Petrini F, Fernandez J. Flexible coscheduling: Mitigating load imbalance and improving utilization of heterogeneous resources. Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), Nice, France, April 2003. IEEE Computer Society Press: Los Alamitos, CA, 2003. 14(6):581--592.


Reconfigurable Gang Scheduling Algorithm - Goes, Martins   (Correct)

No context found.

Frachtenberg, E., Feitelson, D.G., Petrini, F. and Fernandez, J.: Flexible CoScheduling: Mitigating Load Imbalance and Improving Utilization of Heterogeneous Resources. 17th International Parallel and Distributed Processing Symposium. (2003)


Parallel Simulation of Fluid Slip in a Microchannel - Zhou, Zhu, Petzold, Yang (2003)   (Correct)

No context found.

E. Frachtenberg, D. Feitelson, F. Petrini, and J. Fernandez. Flexible CoScheduling: Mitigating Load Imbalance and Improving Utilization of Heterogeneous Resources. In IPDPS03, April 2003.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC