REAL-TIME COMMUNICATIONS IN A COMPUTER-CONTROLLED WORKCELL

被引:25
作者
SHIN, KG
机构
[1] Real-Time Computing Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor
来源
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 1991年 / 7卷 / 01期
关键词
D O I
10.1109/70.68074
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A computer-integrated manufacturing (CIM) system is composed of several workcells, each of which contains robots, NC machines, sensors, and a transport mechanism. Each CIM workcell is controlled by multiple processors interconnected by an intracell bus, but the individual cells are interconnected by an arbitrary network. This paper considers a communication subsystem that is designed to support real-time control and coordination of devices in each CIM cell. The concept of a poll number is proposed to control the access to the intracell bus. The bus access mechanism with the poll number is intended to minimize the probability of real-time messages missing their deadlines. When a CIM task generates a time-constrained message, a poll number is computed for this message according to the message's deadline and the task's prority. When the intracell bus is free, the various tasks at a workcell that desire to use the bus write the poll number onto the bus and read it back, one bit at a time, starting from the most significant bit. If at any time the bit read back is different from the bit written, then the corresponding task drops out of the contention for the bus. Use of a poll number provides not only for decentralized control of the intracell bus, but also a high degree of flexibility in scheduling messages. The performance of the bus access mechanism with a poll number is analyzed and compared with that of a token bus, which is widely used in CIM systems such as MAP networks. The probability of a real-time message missing its deadline in a token bus is found to be much higher than that of the proposed mechanism.
引用
收藏
页码:105 / 113
页数:9
相关论文
共 18 条
  • [1] BEUREMAN SL, 1988, IEEE T COMMUN, V36, P553
  • [2] PRIORITIZED DEMAND ASSIGNMENT PROTOCOLS AND THEIR EVALUATION
    CHLAMTAC, I
    GANZ, A
    KOREN, Z
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1988, 36 (02) : 133 - 143
  • [3] PRIORITY ACCESS SCHEMES USING CSMA-CD
    CHOUDHURY, GL
    RAPPAPORT, SS
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1985, 33 (07) : 620 - 626
  • [4] DOUGLAS RH, 1984, P IEEE COMPCON, P258
  • [6] Jacobson D. W., 1986, Proceedings of the 11th Conference on Local Computer Networks (Cat. No.86CH2338-2), P26
  • [7] KUROSE JF, 1984, COMPUT SURV, V16, P43, DOI 10.1145/861.870
  • [8] ETHERNET - DISTRIBUTED PACKET SWITCHING FOR LOCAL COMPUTER-NETWORKS
    METCALFE, RM
    BOGGS, DR
    [J]. COMMUNICATIONS OF THE ACM, 1976, 19 (07) : 395 - 404
  • [9] QUATSE JT, 1987, CONTROL ENG, V34, P56
  • [10] RAY A, 1987, NOV P NSF WORKSH COM