M. B. Josephs and J. T. Yantchev, "CMOS design of the tree arbiter element," vol. 4, no. 4, pp. 472--476, Dec. 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Real-Time Merging - Greenstreet (Correct)
....This is the fundamental difference between a merge and an arbiter. For example, if both clients request concurrently, then two requests will be eventually forwarded to the parent, but we cannot necessarily identify which parent request came from which client. The eager request arbiter in [5] has a similar property for requests. However, a mutex in each node of their arbiter tree designates a client for each acknowledgement from the parent. In our design, we cannot necessarily identify which parent acknowledgement led to a particuar acknowledgement of a client. Thus, parent events do ....
M. B. Josephs and J. T. Yantchev. CMOS design of the tree arbiter element. IEEE Transactions on VLSI Systems, 4(4):472--476, Dec. 1996.
Priority Arbiters - Bystrov, Kinniment, Yakovlev (1999) (2 citations) (Correct)
....and at the same time transfers the maximum priority value to the output priority bus as shown in Fig. 11(c) This gure illustrates that a grant can be released before priority data reaches the root node. This acceleration technique is similar to that used in a low latency tree arbiter [9]. The di erence is that in the described system slow events are associated with data ow. To minimise latency the data ow and the control part ( valid invalid signals) are maximally decoupled. Synchronisation is performed only when the data are needed to make a decision. This results in better ....
Josephs MB, Yantchev J. CMOS Design of the Tree Arbiter Element. IEEE Trans. on VLSI Systems, 1996, Vol. 4, No. 4, pp. 472-476.
Efficient Arbitration and Bridging Techniques for.. - Maierhofer (1999) (Correct)
....scheduling and verifies its fairness by simulation. In an unconventional approach, Yakovlev et al. 1994) use a signal transition graph to verify and implement their arbiter design, while other publications describe various implementations of arbitration schemes (Macii and Poncino 1995; Josephs and Yantchev 1996; Lee 1997) Many arbitration protocols have thus been proposed, but their performance is frequently assessed in the context of multiprocessor architectures; little research has been published regarding arbitration in multimedia servers. Arbitration in Multiprocessor Machines Contention for ....
Josephs, M. B and J. T Yantchev, 1996. CMOS Design of the Tree Arbiter Element. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 4(4):472--475.
Contributions to the Design of Asynchronous Macromodular Systems - Plana (1998) (Correct)
....have been the focus of most published work. Martin [47] Ebergen [23] and Ebergen et al. 22] have worked on token ring arbiters, formed by a linear chain of modules that circulate a special token, the authorization to grant requests. Seitz [81] Yakovlev et al. 101] and Josephs et al. [38] have presented designs for tree arbiters, formed by a tree of Tree Arbiter Elements (TAE) Figure 4.23(a) shows the TAE and its interface signals. A tree arbiter, constructed using TAEs and an ME is shown in Figure 4.23(b) A balanced tree gives equal priorities to all requestors. The ....
Mark B. Josephs and Jelio T. Yantchev. CMOS design of the tree arbiter element. IEEE Transactions on VLSI Systems, 4(4):472--476, December 1996.
Selecting a Timing Regime for On-Chip Networks - Robert Mullins Jeong-Gun (Correct)
No context found.
M. B. Josephs and J. T. Yantchev, "CMOS design of the tree arbiter element," vol. 4, no. 4, pp. 472--476, Dec. 1996.
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