Fr. 69.00

Job Scheduling Strategies for Parallel Processing - 7th International Workshop, JSSPP 2001, Cambridge, MA, USA, June 16, 2001, Revised Papers

Anglais · Livre de poche

Expédition généralement dans un délai de 1 à 2 semaines (titre imprimé sur commande)

Description

En savoir plus

This book constitutes the thoroughly refereed post-proceedings of the 7th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2001, held in Cambridge, MA, USA, in June 2001.
The 11 revised full papers presented were carefully selected and improved during two rounds of reviewing and revision, and present state-of-the-art results in the area.

Table des matières

Performance Evaluation with Heavy Tailed Distributions.- SRPT Scheduling for Web Servers.- An Efficient and Scalable Coscheduling Technique for Large Symmetric Multiprocessor Clusters.- Coscheduling under Memory Constraints in a NOW Environment.- The Influence of Communication on the Performance of Co-allocation.- Core Algorithms of the Maui Scheduler.- On the Development of an Efficient Coscheduling System.- Effects of Memory Performance on Parallel Job Scheduling.- An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration.- Characteristics of a Large Shared Memory Production Workload.- Metrics for Parallel Job Scheduling and Their Convergence.

Résumé

This book constitutes the thoroughly refereed post-proceedings of the 7th International Workshop on Job Scheduling Strategies for Parallel Processing, JSSPP 2001, held in Cambridge, MA, USA, in June 2001.
The 11 revised full papers presented were carefully selected and improved during two rounds of reviewing and revision, and present state-of-the-art results in the area.

Commentaires des clients

Aucune analyse n'a été rédigée sur cet article pour le moment. Sois le premier à donner ton avis et aide les autres utilisateurs à prendre leur décision d'achat.

Écris un commentaire

Super ou nul ? Donne ton propre avis.

Pour les messages à CeDe.ch, veuillez utiliser le formulaire de contact.

Il faut impérativement remplir les champs de saisie marqués d'une *.

En soumettant ce formulaire, tu acceptes notre déclaration de protection des données.