Optimal dynamic redistribution of divisible load in distributed real-time systems

Proceedings of 2nd IEEE Workshop on Real-Time Applications Pub Date : 1994-07-21 DOI:10.1109/RTA.1994.316135

E. Haddad

{"title":"Optimal dynamic redistribution of divisible load in distributed real-time systems","authors":"E. Haddad","doi":"10.1109/RTA.1994.316135","DOIUrl":null,"url":null,"abstract":"The problem of optimizing the balancing of processing load originating at the various sites of an interconnected set of heterogeneous processors of a real-time system is examined. The distributed load is assumed to be homogeneous and arbitrarily divisible with no particular affinity to individual processors. The heterogeneous processors may or may not have front-end subprocessors, and are characterized by their load processing speeds and I/O speeds pertaining to the transmission of excess load or reception of additional load. The objective of load redistribution, which is carried out during runtime, is to minimize the job execution completion time consisting of the sum of processing lime and I/O time. Depending on the value of total load, the optimal load redistribution is found to be either unique or to admit a multiplicity of solutions. In the first case, all processors complete processing in the same amount of time, which is equal to the minimum job completion time. In the second case, the infinite set of optimal redistributions is represented by load allocations for the individual processors that can range over specified intervals, and the completion limes for the different processors are generally not equal.<<ETX>>","PeriodicalId":399167,"journal":{"name":"Proceedings of 2nd IEEE Workshop on Real-Time Applications","volume":"09 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 2nd IEEE Workshop on Real-Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTA.1994.316135","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

Abstract

The problem of optimizing the balancing of processing load originating at the various sites of an interconnected set of heterogeneous processors of a real-time system is examined. The distributed load is assumed to be homogeneous and arbitrarily divisible with no particular affinity to individual processors. The heterogeneous processors may or may not have front-end subprocessors, and are characterized by their load processing speeds and I/O speeds pertaining to the transmission of excess load or reception of additional load. The objective of load redistribution, which is carried out during runtime, is to minimize the job execution completion time consisting of the sum of processing lime and I/O time. Depending on the value of total load, the optimal load redistribution is found to be either unique or to admit a multiplicity of solutions. In the first case, all processors complete processing in the same amount of time, which is equal to the minimum job completion time. In the second case, the infinite set of optimal redistributions is represented by load allocations for the individual processors that can range over specified intervals, and the completion limes for the different processors are generally not equal.<>

查看原文本刊更多论文

分布式实时系统中可分负荷的最优动态再分配

研究了实时系统中由异构处理器组成的相互连接的不同位置的处理负载的优化平衡问题。假设分布式负载是均匀的，并且可以任意分割，与单个处理器没有特定的关联。异构处理器可以有也可以没有前端子处理器，其特征在于它们的负载处理速度和与传输多余负载或接收额外负载相关的I/O速度。负载重分配在运行时进行，其目标是最小化由处理时间和I/O时间之和组成的作业执行完成时间。根据总负荷值的不同，发现最优负荷重分配要么是唯一的，要么有多个解。在第一种情况下，所有处理器在相同的时间内完成处理，这等于最小作业完成时间。在第二种情况下，最优重分配的无限集由单个处理器的负载分配来表示，这些负载分配可以在指定的间隔内变化，并且不同处理器的完成时间通常是不相等的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of 2nd IEEE Workshop on Real-Time Applications

自引率

0.00%

发文量