RIA: Unified Data and Code Based Program Partitioning on Distributed Memory Systems

RIA：分布式内存系统上的统一数据和基于代码的程序分区

• 批准号: 9412407
• 负责人: Santosh Pande
• 金额: $ 8.5万
• 依托单位: Ohio University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1994
• 资助国家: 美国
• 起止时间: 1994-11-15 至 1997-10-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9412407&HistoricalAwards=false
• 关键词: RIA; Unified; Data; Code; Based

The objective of this effort is to explore the concept of dominant edges and dominant tasks for scheduling parallel programs on a distributed memory processing system. A dominant edge will play a crucial role in generating a task schedule because of the associated communication cost. A dominant task is a coarse grained task with low run time overhead such that they can be rescheduled on a different processor to achieve a load balance. Thus all remaining (non-dominant) tasks will be allocated statically to processors. This project will build on the earlier work on Threshold Scheduling, where the degree of parallelism is treaded off for the schedule length. In this project, the goal is to investigate the threshold scheduling to enhance unified data and code partitioning for a family of distributed memory architectures including Touchstone Delta and Paragon. This will involve the formalization of feasibility conditions and optimality conditions. A feasibility condition guarantees that the schedule delay of a task from its earliest start time is below the threshold and an optimality condition used a merit function to decide the best task-processor match for a set of tasks competing for a given processor.

这项工作的目的是探索的概念，优势和优势任务调度并行程序的分布式内存处理系统。 由于相关的通信成本，优势将在生成任务调度中起关键作用。 主要任务是具有低运行时间开销的粗粒度任务，使得它们可以在不同的处理器上重新调度以实现负载平衡。 因此，所有剩余的（非主导）任务将被静态分配给处理器。 这个项目将建立在早期的工作阈值调度，其中的并行度是踩小康的时间表长度。 在这个项目中，我们的目标是研究阈值调度，以增强统一的数据和代码分区的分布式内存架构，包括试金石三角洲和Paragon的家庭。 这将涉及可行性条件和最优性条件的形式化。 可行性条件保证任务从其最早开始时间的调度延迟低于阈值，并且最优性条件使用优值函数来决定一组竞争给定处理器的任务的最佳任务处理器匹配。