首页> 外文OA文献 >A flexible simulation framework for processor scheduling algorithms in multicore systems.
【2h】

A flexible simulation framework for processor scheduling algorithms in multicore systems.

机译:用于多核系统中处理器调度算法的灵活仿真框架。

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In traditional uniprocessor systems, processor scheduling is the responsibility of the operating system. In high performance computing (HPC) domains that largely involve parallel processors, the responsibility of scheduling is usually left to the applications. So far, parallel computing has been confined to a small group of specialized HPC users. In this context, the hardware, operating system, and the applications have been mostly designed independently with minimal interactions. As the multicore processors are becoming the norm, parallel programming is expected to emerge as the mainstream software development approach. This new trend poses several challenges including performance, power management, system utilization, and predictable response. Such a demand is hard to meet without the cooperation from hardware, operating system, and applications. Particularly, an efficient scheduling of cores to the application threads is fundamentally important in assuring the above mentioned characteristics. We believe, operating system requires to take a larger responsibility in ensuring efficient multicore scheduling of application threads. To study the performance of a new scheduling algorithm for the future multicore systems with hundreds and thousands of cores, we need a flexible scheduling simulation testbed. Designing such a multicore scheduling simulation testbed and illustrating its functionality by studying some well known scheduling algorithms Linux and Solaris are the main contributions of this thesis. In addition to studying Linux and Solaris scheduling algorithms, we demonstrate the power, flexibility, and use of the proposed scheduling testbed by simulating two popular gang scheduling algorithms - adaptive first-come-first-served (AFCFS) and largest gang first served (LGFS). As a result of this performance study, we designed a new gang scheduling algorithm and we compared its performance with AFCFS. The proposed scheduling simulation testbed is developed using Java and expected to be released for public use.
机译:在传统的单处理器系统中,处理器调度是操作系统的责任。在主要涉及并行处理器的高性能计算(HPC)域中,调度的责任通常留给应用程序。到目前为止,并行计算仅限于一小部分专业的HPC用户。在这种情况下,大多数情况下,硬件,操作系统和应用程序都是独立设计的,并且交互最少。随着多核处理器成为规范,并行编程有望成为主流软件开发方法。这种新趋势带来了一些挑战,包括性能,电源管理,系统利用率和可预测的响应。没有硬件,操作系统和应用程序的合作,很难满足这样的需求。特别地,对应用线程的内核进行有效的调度对于确保上述特性至关重要。我们认为,操作系统需要承担更大的责任,以确保对应用程序线程进行有效的多核调度。为了研究针对具有成千上万个内核的未来多核系统的新调度算法的性能,我们需要一个灵活的调度仿真测试平台。通过研究一些著名的调度算法Linux和Solaris,设计这样的多核调度仿真测试平台并说明其功能是本论文的主要贡献。除了研究Linux和Solaris调度算法外,我们还通过模拟两种流行的帮派调度算法-自适应先到先得(AFCFS)和最大帮派先到服务(LGFS)来演示所建议的调度测试平台的功能,灵活性和使用。 )。这项性能研究的结果是,我们设计了一种新的帮派调度算法,并将其性能与AFCFS进行了比较。拟议的调度仿真测试平台是使用Java开发的,预计将发布以供公众使用。

著录项

  • 作者

  • 作者单位
  • 年度 2012
  • 总页数
  • 原文格式 PDF
  • 正文语种 English
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号