Processor Allocation in Partitionable Parallel Architectures

可分区并行架构中的处理器分配

• 批准号: 9209345
• 负责人: Bhagirath Narahari
• 金额: $ 9万
• 依托单位: George Washington University
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 1992
• 资助国家: 美国
• 起止时间: 1992-06-15 至 1995-11-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9209345&HistoricalAwards=false
• 关键词: Processor; Allocation; Partitionable; Parallel; Architectures

A partitionable parallel architecture allows the simultaneous execution of a number of tasks, where each task can be executed on a number of processors. This model introduces the problem of how many processors to allocate to each task. The processor allocation process must (1) determine the number of processors required to process each task and (2) allocate and schedule these tasks on the processors in the system. The objective is to minimize the time to complete all the tasks. In most cases at the current time, the number of processors assigned to each task is determined manually thereby leading to under-utilization of the processors. This project considers the design of efficient processor allocation algorithms for a large class of partitionable parallel architectures. The conventional scheduling problems, where each job runs on one processor, differ significantly from the processor allocation problem and thus their solutions cannot be expected to perform adequately for this processor allocation problem. The objectives of this project are to study the processor allocation problem, under different computation and architecture models, and design and evaluate algorithms for processor assignment and processor scheduling. These algorithms are tested, through both a simulation and their application to real problems. The performance gains made by the algorithms, and the overheads incurred by the operating system, are measured through experiments performed on different parallel architectures. The results from this research are expected to provide a definite step forward in understanding resource allocation and scheduling problems in partitionable architectures, and consequently lead to a better utilization of parallel architectures.

可分配的并行体系结构允许同时执行多个任务，其中每个任务都可以在许多处理器上执行。 该模型介绍了分配给每个任务多少处理器的问题。 处理器分配过程必须（1）确定处理每个任务所需的处理器数量，以及（2）在系统中的处理器上分配和安排这些任务。 目的是最大程度地减少完成所有任务的时间。 在当前的大多数情况下，分配给每个任务的处理器数量是手动确定的，从而导致处理器利用不足。 该项目考虑了针对大量可分配并行体系结构的有效处理器分配算法的设计。 每个作业在一个处理器上运行的常规调度问题与处理器分配问题有很大差异，因此不能期望其解决方案在此处理器分配问题上表现出足够的性能。 该项目的目标是在不同的计算和体系结构模型下研究处理器分配问题，并设计和评估处理器分配和处理器计划的算法。 这些算法通过模拟及其在实际问题上的应用进行了测试。 算法获得的性能增长以及操作系统产生的开销，是通过在不同的并行体系结构上进行的实验来测量的。 预计这项研究的结果将在理解可分配架构中的资源分配和调度问题方面迈出一定的一步，因此可以更好地利用并行体系结构。