DISTRIBUTED BROADCAST CHANNEL ACCESS

被引：26

作者：

MOK, AK

WARD, SA

机构：

来源：

COMPUTER NETWORKS AND ISDN SYSTEMS | 1979年 / 3卷 / 05期

关键词：

broadcast channel access; deadlock avoidance; distributed systems; dynamic priority; Local networks; resource sharing;

D O I：

10.1016/0376-5075(79)90003-5

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents a general approach to sharing a broadcast channel among multiple processors. There are two components to the problem of sharing a single resource: (1) How to specify the usage pattern of the resource; and (2) How to restrict access to the resource so that the specified usage pattern can be realized. One way to solve both of these problems is solved by embodying the desired usage pattern in priority update algorithms which assign unique priorities to all the users. The secobd problem then becomes that of determining the competing user who has the highest priority when the resource is free. Solutions are proposed which promise the combined advantages of ethernet (short message delay) and ringnet (high throughput). © 1979.

引用

页码：327 / 335

页数：9