loading...
Low Cost Arbitration Method for Arbitrarily Scalable Multiprocessor Systems
January 23-January 25
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DELTA.2008.734th IEEE International Symposium on E ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Arbitration methods are needed to prevent conflicts when several processing units share a common resource. Despite of there being a plethora of different arbitration methods available, there is not an optimal solution for every case. Our case requires a distributed, modular, simple, fast, freely scalable, and inexpensive arbitration method. Emerged from our special need, we have developed a simple daisy chain type of arbitration that is modularly expandable and implements a geographical priority scheme with a possibility for dynamic priority. This arbitration can be implemented with two inexpensive 74-series logic gates or programmable logic. It can be used with systems that require arbitrary modular scalability, few IO-lines and low cost.
Index Terms:
Embedded Object Concept, Atomi, Embedded System, Arbitration, Scalable, Modular
Citation:
Tero Vallius, Juha R?ning, "Low Cost Arbitration Method for Arbitrarily Scalable Multiprocessor Systems," delta, pp.119-124, 4th IEEE International Symposium on Electronic Design, Test and Applications (delta 2008), 2008
Usage of this product signifies your acceptance of the Terms of Use.