首页> 外国专利> Optimal parallel processor architecture for real time multitasking background of the invention

Optimal parallel processor architecture for real time multitasking background of the invention

机译:用于实时多任务的最佳并行处理器架构背景技术

摘要

A process for producing a parallel processor system having the minimum number of microprocessors necessary execute in real time a set of tasks of a multi-tasking application such that execution of an activity of a first task is followed by execution of an activity of a second task. The process includes the step of selecting an initial number of microprocessors for executing the application in real-time. The selecting step includes placing in a first column of a matrix all real-time constrained tasks specific to the application and associating a row of dependent tasks with each task placed in the first column of the matrix to define a plurality of task subsets, each subset incorporating a maximum number of intradependent tasks and a minimum number of interdependent tasks and the number of subsets corresponding to the initial number of microprocessors. The inventive process further includes the steps of listing dependencies between rows in a second column of the matrix, assigning a priority pi to each task where Pi is between 0 and 1, subdividing at least one of the tasks into discrete activities, each of the activities having a corresponding execution time tij, estimating the execution time for each activity, reducing the number of rows in the matrix by grouping together tasks having activities that can be executed within a predetermined time window T, and providing a number of microprocessors corresponding to the number of rows obtained from the rows reducing step.
机译:一种用于生产具有最少数量的必需微处理器的并行处理器系统的过程,该并行处理器系统实时执行多任务应用程序的一组任务,从而在执行第一任务的活动之后执行第二任务的活动。该过程包括选择初始数量的微处理器以实时执行该应用程序的步骤。选择步骤包括将特定于应用程序的所有实时约束任务放置在矩阵的第一列中,并将一行相关任务与放置在矩阵的第一列中的每个任务相关联,以定义多个任务子集,每个子​​集包含最大数量的内部依赖任务和最小数量的相互依赖任务以及对应于微处理器初始数量的子集数量。本发明的过程还包括以下步骤:列出矩阵的第二列中的行之间的相关性;将优先级pi分配给Pi在0和1之间的每个任务,将至少一个任务细分为离散活动,每个活动具有对应的执行时间tij,估算每个活动的执行时间,通过将具有可以在预定时间窗T内执行的活动的任务组合在一起,减少矩阵中的行数,并提供与该数目对应的微处理器从行减少步骤获得的行数。

著录项

  • 公开/公告号EP0682311A2

    专利类型

  • 公开/公告日1995-11-15

    原文格式PDF

  • 申请/专利权人 AT&T CORP.;

    申请/专利号EP19950303018

  • 发明设计人 KARTALOPOULOS STAMATIOS VASILIOS;

    申请日1995-05-03

  • 分类号G06F9/46;

  • 国家 EP

  • 入库时间 2022-08-22 03:48:19

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号