| Job Scheduling Strategies for Parallel Processing: Ipdps 2000 Workshop, Jsspp 2000, Cancun, Mexico, May 1, 2000 Proceedings 2000 Edition Contributor(s): Feitelson, Dror G. (Editor), Rudolph, Larry (Editor) |
|
 |
ISBN: 3540411208 ISBN-13: 9783540411208 Publisher: Springer OUR PRICE: $52.24 Product Type: Paperback - Other Formats Published: October 2000 |
| Additional Information |
| BISAC Categories: - Computers | Systems Architecture - Distributed Systems & Computing - Computers | Computer Science - Computers | Logic Design |
| Dewey: 005.434 |
| LCCN: 00048270 |
| Series: Lecture Notes in Computer Science |
| Physical Information: 0.48" H x 8.5" W x 11" (1.19 lbs) 209 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: This volume contains the papers presented at the sixth workshop on Job Sched- ing Strategies for Parallel Processing, which was held in conjunction with the IPDPS 2000 Conference in Cancun, Mexico, on 1 May 2000. The papers have been through a complete refereeing process, with the full version being read and evaluated by ?ve to seven members of the program committee. We would like to take this opportunity to thank the program committee, Andrea Arpaci-Dusseau, Fran Berman, Steve Chapin, Allen Downey, Allan Gottlieb, Atsushi Hori, Phil Krueger, Richard Lagerstrom, Virginia Lo, Reagan Moore, Bill Nitzberg, Uwe Schwiegelshohn, and Mark Squillante, for an excellent job. Thanks are also due to the authors for their submissions, presentations, and ?nal revisions for this volume. Finally, we would like to thank the MIT Laboratory for Computer S- ence and the Computer Science Institute at the Hebrew University for the use of their facilities in the preparation of these proceedings. This was the sixth annual workshop in this series, which re?ects the continued interest in this ?eld. The previous ?ve were held in conjunction with IPPS'95 through IPPS/SPDP'99. Their proceedings are available from Springer-Verlag as volumes 949, 1162, 1291, 1459, and 1659 of the Lecture Notes in Computer Science series. The last two are also available on-line from Springer LINK. |