找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Job Scheduling Strategies for Parallel Processing; IPPS ‘97 Workshop, G Dror G. Feitelson,Larry Rudolph Conference proceedings 1997 Springe

[复制链接]
查看: 47872|回复: 47
发表于 2025-3-21 20:00:07 | 显示全部楼层 |阅读模式
书目名称Job Scheduling Strategies for Parallel Processing
副标题IPPS ‘97 Workshop, G
编辑Dror G. Feitelson,Larry Rudolph
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Job Scheduling Strategies for Parallel Processing; IPPS ‘97 Workshop, G Dror G. Feitelson,Larry Rudolph Conference proceedings 1997 Springe
描述This book constitutes the strictly refereed post-workshop proceedings of the 1997 IPPS Workshop on Job Scheduling Strategies for Parallel Processing held in Geneva, Switzerland, in April 1997, as a satelite meeting of the IEEE/CS International Parallel Processing Symposium..The 12 revised full papers presented were carefully reviewed and revised for inclusion in the book. Also included is a detailed introduction surveying the state of the art in the area. Among the topics covered are processor allocation, parallel scheduling, massively parallel processing, shared-memory architectures, gang scheduling, etc.
出版日期Conference proceedings 1997
关键词Scheduling; algorithm; algorithms; job scheduling; load balancing; modeling; multiprocessor architectures;
版次1
doihttps://doi.org/10.1007/3-540-63574-2
isbn_softcover978-3-540-63574-1
isbn_ebook978-3-540-69599-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 1997
The information of publication is updating

书目名称Job Scheduling Strategies for Parallel Processing影响因子(影响力)




书目名称Job Scheduling Strategies for Parallel Processing影响因子(影响力)学科排名




书目名称Job Scheduling Strategies for Parallel Processing网络公开度




书目名称Job Scheduling Strategies for Parallel Processing网络公开度学科排名




书目名称Job Scheduling Strategies for Parallel Processing被引频次




书目名称Job Scheduling Strategies for Parallel Processing被引频次学科排名




书目名称Job Scheduling Strategies for Parallel Processing年度引用




书目名称Job Scheduling Strategies for Parallel Processing年度引用学科排名




书目名称Job Scheduling Strategies for Parallel Processing读者反馈




书目名称Job Scheduling Strategies for Parallel Processing读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

1票 100.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:57:44 | 显示全部楼层
An experimental evaluation of processor pool-based scheduling for shared-memory NUMA multiprocessorthe fewest jobs) and of isolating applications from each other are desirable properties of algorithms for operating system schedulers executing on NUMA architectures. The “Worst-Fit” policy we examine incorporates both of these properties.
发表于 2025-3-22 03:45:59 | 显示全部楼层
Objective-oriented algorithm for job scheduling in parallel heterogeneous systems,-Oriented Algorithm (OOA), the time complexity for scheduling is decreased to O(n(E+nlogn)). The simulation results show us that OOA provides better solution quality while scheduling time is less than the existing methods.
发表于 2025-3-22 06:05:39 | 显示全部楼层
Using queue time predictions for processor allocation,del based on observed workloads at the San Diego Supercomputer Center and the Cornell Theory Center, and use this model to drive simulations of various allocation strategies. We find that prediction-based allocation not only improves the turnaround time of individual jobs; it also improves the utilization of the system as a whole.
发表于 2025-3-22 10:14:59 | 显示全部楼层
Improved utilization and responsiveness with gang scheduling,n other time slices. This added flexibility is shown to improve overall system utilization and responsiveness. Empirical evidence from using gang scheduling on a Cray T3D installed at Lawrence Livermore National Lab corroborates these results, and shows conclusively that gang scheduling can be very effective with current technology.
发表于 2025-3-22 15:37:54 | 显示全部楼层
发表于 2025-3-22 20:54:32 | 显示全部楼层
发表于 2025-3-22 22:34:30 | 显示全部楼层
PScheD Political scheduling on the CRAY T3E,This paper describes the components that help realize the . goals of the CRAY T3E system. The meaning of Political Scheduling is defined, we present a general overview of the Cray T3E hardware and operating system and describe the current implementation of the Political Scheduling feature of Unicos/mk.
发表于 2025-3-23 04:49:59 | 显示全部楼层
发表于 2025-3-23 06:14:08 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-3 07:51
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表