首页 | 官方网站   微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 156 毫秒
1.
杨义军  陆鑫达 《计算机工程》2004,30(13):47-49,186
神威计算机系统提供了强大的并行计算和批处理能力,代表了高性能计算机发展的新方向。作为系统软件的重要组成部分,作业管理系统可以根据用户的需求,统一管理和调度系统的软硬件资源,保证用户作业合理地使用机器资源,提高了系统利用率和吞吐率。该文主要介绍了神威高性能计算机系统的作业管理系统及其批式作业调度模块的设计思路和实现。  相似文献   

2.
当前的高性能计算系统的资源管理和调度关注的焦点是计算资源,然而随着高性能计算系统的规模增大和计算能力增强,其I/O瓶颈问题日益突出.由于高性能计算系统的存储结构多样性带来了存储资源管理分配的难题,在目前主流的资源管理系统中尚未有针对I/O存储资源的调度和管理.随着对象存储结构的发展和广泛使用,大多数主流高性能系统采用分布对象存储系统,研究对分布对象存储系统的管理并结合资源管理系统,实现面向存储的作业优化调度,对提升高性能计算系统的实际性能有重要意义.针对具有分布对象存储结构的高性能计算系统,研究面向分布存储的资源管理方法,在作业调度和资源分配时考虑不同应用的I/O需求,通过建立分布对象存储资源模型和应用程序I/O能力需求模型,并在资源调度和分配上根据不同的I/O应用级别,为作业分配合适的存储资源,设计并实现基于I/O能力分级的作业调度和资源分配算法.系统测试表明:该方法可以显著提高多作业环境下应用的性能,保证应用程序的性能稳定性,提高系统的吞吐率.  相似文献   

3.
Grid programming: some indications where we are headed   总被引:2,自引:0,他引:2  
D. Laforenza 《Parallel Computing》2002,28(12):1733-1752
Grid computing enables the development of large scientific applications on an unprecedented scale. Grid-aware applications, also called meta-applications or multi-disciplinary applications, make use of coupled computational resources that are not available at a single site. In this light, the Grids let scientists solve larger or new problems by pooling together resources that could not be coupled easily before. It is well known that the programmer’s productivity in designing and implementing efficient distributed/parallel applications on high-performance computers is still usually a very time-consuming task. Grid computing makes the situation worse. Consequently, the development of Grid programming environments that would enable programmers to efficiently exploit this technology is an important and hot research issue.

After an introduction on the main Grid programming issues, this paper will review the most important approaches/projects conducted in this field worldwide.  相似文献   


4.
Dynamic scheduling of manufacturing job shops using genetic algorithms   总被引:2,自引:1,他引:1  
Most job shop scheduling methods reported in the literature usually address the static scheduling problem. These methods do not consider multiple criteria, nor do they accommodate alternate resources to process a job operation. In this paper, a scheduling method based on genetic algorithms is developed and it addresses all the shortcomings mentioned above. The genetic algorithms approach is a schedule permutation approach that systematically permutes an initial pool of randomly generated schedules to return the best schedule found to date.A dynamic scheduling problem was designed to closely reflect a real job shop scheduling environment. Two performance measures, namely mean job tardiness and mean job cost, were used to demonstrate multiple criteria scheduling. To span a varied job shop environment, three factors were identified and varied between two levels each. The results of this extensive simulation study indicate that the genetic algorithms scheduling approach produces better scheduling performance in comparison to several common dispatching rules.  相似文献   

5.
石宣化  金海 《计算机科学》2007,34(6):131-135
在网格中数据密集型应用的管理由于需要综合考虑多种资源属性而变得非常复杂,本文针对该问题提出了一种有服务质量保证的数据密集型网格应用管理方法,该方法通过两个方面来保证服务质量,首先是通过基于数据可靠性的副本管理策略提高数据的可用性,其次采用基于任务截至期限的任务调度策略来动态调度任务.最后,给出模拟试验测试以及实际网格平台与实际应用的测试,测试结果表明本文提出的方法较其它方法有很大提高.  相似文献   

6.
网格应用程序执行时间预测系统   总被引:2,自引:0,他引:2  
为了合理利用网格资源和改进应用程序的执行性能,需要对应用程序的执行时间进行实时预测,为任务调度系统和网格用户提供调度依据.本文工作建立了执行时间预测系统,周期性的产生预测信息并转换为统一格式注册到网格信息服务中.本文使用资源映射方法预测应用程序执行时间,并且设计一组实验测试系统性能.实验结果表明,本系统能够低开销,灵敏地预测执行时间,并且预测误差较小.  相似文献   

7.
The ever growing number of computation-intensive applications calls for utilizing large-scale, potentially interoperable distributed infrastructures. Nowadays, such distributed systems enable the management of heterogeneous scientific workflows of considerable sizes, where job scheduling and resource management is a crucial issue. In this paper we focus on the challenges of scheduling parameter sweep applications, a specific and commonly used type of workflows where ordering of job executions is irrelevant. A parameter sweep has a large set of independent job instances, called a multi-job, submitted for execution in a single step. In order to cope with the high uncertainty and unpredictable load of resources, and the simultaneous submissions of multi-job instances, we propose a statistics-based brokering approach for allocating jobs to resources so that the makespan is minimised. Earlier studies claim that users’ predictions on job runtime are inaccurate and unusable for scheduling. Our aim is to examine, whether statistical trace data for the same purpose is efficient compared to randomized allocation.  相似文献   

8.
随着网络技术的发展,群机计算管理软件作为对群机计算资源进行统一管理的中间件,越来越受到人们的关注。如何合理地管理地理上相对分散的计算资源,达到资源共享的目标,是群机系统发挥性能的关键。文章首先给出了一个基于资源集合概念的资源管理模型,在此基础上,研究了群机系统的资源分配和负载管理问题,并结合作业调度过程说明了资源管理模型与策略的应用。  相似文献   

9.
This paper first develops architecture for a multiprocessor job scheduling system with an embedded simulation technique. The architecture provides a shell for applications that are characterized by two scheduling policies, a heuristic algorithm policy and a First-In-First-Out (FIFO) policy. These policies are implemented in the simulation model by using the embedded technique. The paper evaluates these two policies using the queue length, waiting time and flow time as the criteria to compare the performance of these two scheduling policies. Next we designed two simulation situations using two different real world applications. The purpose is to examine the performances of multiprocessor systems with and without inspection operations and two different scheduling policies. The two applications, berth allocation for the container terminal operations and production scheduling arrangement in an Original Equipment Manufacturer (OEM) power supply factory, are studied. The final results show that a proper scheduling policy will perform better than the traditional FIFO approach for a multiprocessor system. Our study also provides guidelines on balancing a system with the addition of a final inspection activity.  相似文献   

10.
机群作业管理是机群系统软件的重要组成部分,作业调度策略则是机群作业管理系统的核心.作业调度策略的选择不仅关系到机群系统的效率,还影响了用户作业的响应时间.目前,Firstfit调度算法已经相当成熟并且广泛应用于机群作业调度.传统的Firstfit算法虽然着眼于减少资源碎片,但未能解决作业饥饿问题.曙光超级服务器作业管理系统JMS改进了既有的结合Firstfit和优先级的作业调度算法P-FIFT,将预约和回填策略与Firstfit相结合,引入了新的RB-FIFT调度策略.实验结果表明,与传统Firstfit算法及P—FIFT算法比较,RB-FIFT调度策略不但能够消除系统中作业的饥饿现象,而且大大减少了资源碎片,提高了系统的吞吐率和资源利用率.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号