default search action
JSSPP 2006: Saint-Malo, France
- Eitan Frachtenberg, Uwe Schwiegelshohn:
Job Scheduling Strategies for Parallel Processing, 12th International Workshop, JSSPP 2006, Saint-Malo, France, June 26, 2006, Revised Selected Papers. Lecture Notes in Computer Science 4376, Springer 2007, ISBN 3-540-71034-5 - Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson:
Provably Efficient Two-Level Adaptive Scheduling. 1-32 - Márcia C. Cera, Guilherme P. Pezzi, Maurício L. Pilla, Nicolas Maillard, Philippe Olivier Alexandre Navaux:
Scheduling Dynamically Spawned Processes in MPI-2. 33-46 - Henan Zhao, Rizos Sakellariou:
Advance Reservation Policies for Workflows. 47-67 - Carsten Franke, Joachim Lepping, Uwe Schwiegelshohn:
On Advantages of Scheduling Using Genetic Fuzzy Systems. 68-93 - Gerald Sabin, Matthew Lang, P. Sadayappan:
Moldable Parallel Job Scheduling Using Job Efficiency: An Iterative Approach. 94-114 - Lawrence Barsanti, Angela C. Sodan:
Adaptive Job Scheduling Via Predictive Job Resource Allocation. 115-140 - Gaurav Khanna, Ümit V. Çatalyürek, Tahsin M. Kurç, P. Sadayappan, Joel H. Saltz:
A Data Locality Aware Online Scheduling Approach for I/O-Intensive Jobs with File Sharing. 141-160 - Deepti Vyas, Jaspal Subhlok:
Volunteer Computing on Clusters. 161-175 - Javier Bustos-Jiménez, Denis Caromel, José M. Piquer:
Load Balancing: Toward the Infinite Network and Beyond. 176-191 - Jonathan Weinberg, Allan Snavely:
Symbiotic Space-Sharing on SDSC's DataStar System. 192-209 - Hui Li, Michael Muskulus, Lex Wolters:
Modeling Job Arrivals in a Data-Intensive Grid. 210-231 - Alexandru Iosup, Dick H. J. Epema, Carsten Franke, Alexander Papaspyrou, Lars Schley, Baiyi Song, Ramin Yahyapour:
On Grid Performance Evaluation Using Synthetic Workloads. 232-255
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.