J.K. Strosneider, T.E. Marchok, "Responsive, deterministic IEEE 802.5 Token Ring Scheduling", Journal of Real-Time Systems, 1(2), 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of these algorithms is demonstrated mainly by simulation using certain stochastic arrival and deadline patterns. On the other hand, when the system has some information about the arrival pattern of messages, it can provide guarantees about their delivery times. For example, Strosnider and Marchok [40] use a variation of the rate monotonic scheduling algorithm to control access to a token ring network. They assign priorities at design time to message sources based on the periodicity of message generation using which they can check for the possibility of deadline overrun. In their work, the ....

J. K. Strosnider and T. E. Marchok, "Responsive, deterministic IEEE 802.5 token ring scheduling," Journal of Real-Time Systems, vol. 1, no. 2, pp. 133--158, September 1989.

....apply the well known results obtained for processor scheduling to the existing network standards. The result of their studies has been a set of protocols that use a static priority ordering to solve the contention for the channel. The scheduling of real time periodic messages has been studied in [9], 10] for the Token ring and CAN standards. Another This work has been supported in part by the Commission of the European Communities under contract ERBCHBGCT930458, proposal ERB4050PL931117. work [7] has produced schedulability bounds for realtime messages in timed token networks. A static ....

.... of the previous factors: C i = T i tr O i v1 O i v2 = l m i d m d B r O vt 2 L V p N Br : To evaluate B, the maximum time a highest priority station must wait before beeing able to send a message, we consider the worst case as described by Strosnider and Marchok [9]. We found [8] that the value of B is given by twice the frame rotation time T fr , frame overheads included, minus the time T needed to send the frame bits that are prior to the reservation bits: B = 2T fr 2O vt Gamma T : Once the values C i and B are known, the schedulability of a ....

Strosnider J.K. and Marchok T.E., "Responsive, Deterministic IEEE 802.5 Token-Ring Scheduling, " The Journal of Real-Time Systems, 1, pp. 133-158, 1989.

.... synchronous protocols like the token bus [2] and the time triggered protocol (TTP) 3] They satisfy the second requirement but not the first: it is well known that these protocols give a large worst case bus access latency making them unsuitable for systems with tight deadline sporadic messages [4]. SOF Identifier Control Data CRC Ack EOF SOF: Start of Frame CRC: Cyclic Redundancy Code EOF: End of Frame Figure 1: Various fields in the CAN data frame. The Controller Area Network (CAN) 5, 6] is a contention based multi master network which uses a wired OR (or wired AND) bus and has the ....

J. K. Strosnider and T. E. Marchok, "Responsive, deterministic IEEE 802.5 token ring scheduling," Journal of Real-Time Systems, vol. 1, no. 2, pp. 133--158, September 1989.

....goal in designing a real time system is predictability. The scheduling of real time messages in communication networks, too, is aimed at this goal. So far, mostly static approaches have been followed to tackle the problem. Among them we find analysis of existing standards, such as the Token Ring [7], or the Controller Area Network [8] which are both based on extensions of uniprocessor fixed priority analysis, or timed token networks [4] A different approach, still based on a static technique though, is found in the Time Triggered Protocol (TTP) 2] where the assignment of the network is ....

Strosnider J.K. and Marchok T.E., "Responsive, Deterministic IEEE 802.5 Token-Ring Scheduling," The Journal of Real-Time Systems, 1, pp. 133-158, 1989.

....case, there are several techniques for medium access control protocols in LANS. There are techniques for CSMA CD networks, such as the virtual time method [Zha87] and windowed protocols [Dol89] There are also some protocols based in token ring, such as the ones described in [Ram90] Mal94] or [Str89]. In the case of routing for Wide Area Networks, we can mention the DASH [And88] and Tenet [Fer89] projects. Several other projects have addressed the use of multiprocessors for real time systems, but they do not address the problems existing in the communications networks. For instance, MARS ....

STROSNIDER, J.; MARCHOK, T. "Responsive, deterministic IEEE 802.5 token ring scheduling". Journal of Real-Time systems, vol. 1. pp. 133-158. September 1989.

....a scheme which preserves delivery time guarantees. Index Terms Real time systems, communication, scheduling, guaranteed delay, point to point networks. The work reported here is supported in part by an IBM Graduate Fellowship and by the Office of Naval Research under Contract N00014 85 K 0122. Any opinions, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the funding agencies. 1 Introduction Due to their potential for high perfomance and high reliability, multicomputer systems with ....

....algorithms is demonstrated mainly by simulation using certain stochastic arrival and deadline patterns. On the other hand, when the system has some information about the arrival pattern of messages, it can try to give guarantees about their delivery times. For example, Strosnider and Marchok [5] use a variation of the rate monotonic scheduling algorithm to control access to a token ring network. They assign priorities at design time to message sources based on the periodicity of message generation and they can check for the possibility of deadline overrun at that time. In their work, ....

[Article contains additional citation context not shown here]

J. K. Strosnider and T. E. Marchok, "Responsive, deterministic IEEE 802.5 token ring scheduling," Journal of Real-Time Systems, vol. 1, pp. 133--158, Sept. 1989.

.... 5, 1993 Real time Communication in Multi hop Networks Dilip D. Kandlur IBM T. J. Watson Research Center Yorktown Heights, NY 10598. email: kandlur watson.ibm.com Kang G. Shin Real Time Computing Laboratory Department of Elec. Engr. and Computer Science The University of Michigan Ann Arbor, ....

....5, 1993 Real time Communication in Multi hop Networks Dilip D. Kandlur IBM T. J. Watson Research Center Yorktown Heights, NY 10598. email: kandlur watson.ibm.com Kang G. Shin Real Time Computing Laboratory Department of Elec. Engr. and Computer Science The University of Michigan Ann Arbor, Michigan 48109 2122. email: kgshin alps.eecs.umich.edu Domenico Ferrari Computer Science Division EE CS Department University of ....

[Article contains additional citation context not shown here]

J. K. Strosnider and T. E. Marchok, "Responsive, deterministic IEEE 802.5 token ring scheduling," Journal of Real-Time Systems, vol. 1, pp. 133--158, Sept. 1989.

....Management and Guarantees End to end scheduling requires that the network services guarantee the delivery of messages within their deadlines. Most of the research results in this area have been developed for the case of synchronous or periodic messages having deadlines equal to their periods [13] [6] Few of the previous results can be applied to dynamic systems. The reason is that in dynamic systems there is no a priori assumption on the nature of the messages that are exchanged on the network. What is also needed is a scheme that can be integrated with the processor scheduling ....

....static scheduler responsible for computing the activation times for all the tasks in the system. A static approach is also used in the MARS system [4] as described earlier in section 1 Other research results focused on the problem of scheduling the messages on the network. In particular Strosnider [13] and later Pleinevaux [8] found schedulability conditions for synchronous and asynchronous messages, to be scheduled with priority based protocols on token ring networks. The schemes proposed by these authors require the knowledge of either the task periods or the minimum interarrival times. ....

J. K. Strosnider, T. E. Marchok, "Responsive, Deterministic IEEE 802.5 Token Ring Scheduling, " Real Time Systems Journal 1-2, Sep. 1989.

No context found.

J.K. Strosneider, T.E. Marchok, "Responsive, deterministic IEEE 802.5 Token Ring Scheduling", Journal of Real-Time Systems, 1(2), 1989.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC