Traffic relationships in networks of tasks

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI:10.1109/INFCOM.1989.101467

C. Woodside, G. Yee

{"title":"Traffic relationships in networks of tasks","authors":"C. Woodside, G. Yee","doi":"10.1109/INFCOM.1989.101467","DOIUrl":null,"url":null,"abstract":"A network of communicating software tasks in a distributed system is considered. Over the period of interest they are permanent concurrent entities, statically allocated to processors. Tasks communicate by messages sent to ports, sockets, or entries. A task execution is such that for each message received on a certain port, a known average number of other actions takes place, including sending of messages and waiting for replies, or reception of messages on some designated port. Various interesting special cases occur. From the behavior model and parameters of each task, network-wide relationships are obtained that govern the rates of intertask messaging. Certain rates may be taken as independent and they determine the remaining rates. In some cases, a narrowly constrained operating subspace results which contains all feasible task-throughput combinations. The relationships cover a variety of types of tasks and types of communication mechanisms, including rendezvous as well as nonblocking send with blocking receive.<<ETX>>","PeriodicalId":275763,"journal":{"name":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","volume":"134 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1989.101467","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

Abstract

A network of communicating software tasks in a distributed system is considered. Over the period of interest they are permanent concurrent entities, statically allocated to processors. Tasks communicate by messages sent to ports, sockets, or entries. A task execution is such that for each message received on a certain port, a known average number of other actions takes place, including sending of messages and waiting for replies, or reception of messages on some designated port. Various interesting special cases occur. From the behavior model and parameters of each task, network-wide relationships are obtained that govern the rates of intertask messaging. Certain rates may be taken as independent and they determine the remaining rates. In some cases, a narrowly constrained operating subspace results which contains all feasible task-throughput combinations. The relationships cover a variety of types of tasks and types of communication mechanisms, including rendezvous as well as nonblocking send with blocking receive.<>

查看原文本刊更多论文

任务网络中的流量关系

考虑了分布式系统中软件任务的通信网络。在使用期间，它们是永久并发实体，静态地分配给处理器。任务通过发送到端口、套接字或条目的消息进行通信。任务执行是这样的:对于在某个端口上接收到的每个消息，会发生已知的平均数量的其他操作，包括发送消息和等待回复，或在某个指定端口上接收消息。出现了各种有趣的特殊情况。从每个任务的行为模型和参数中，得到控制任务间消息传递速率的全网关系。某些汇率可能被视为独立的，它们决定了其余的汇率。在某些情况下，窄约束的操作子空间包含了所有可行的任务吞吐量组合。这些关系涵盖了各种类型的任务和类型的通信机制，包括集合以及非阻塞发送与阻塞接收。

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

求助全文

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

来源期刊

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies

自引率

0.00%

发文量