Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

It is impossible to make an unambiguous choice between near-simultaneous events under a deadline. How can computations choose reliably?

REFERENCES

• 1: Alfke, P. Metastable recovery in Virtex-II Pro FPGAs. Technical report xapp094 (Feb. 2005); available from the Xilinx.com Web site.
• 2: T. J. Chaney , C. E. Molnar, Anomalous Behavior of Synchronizer and Arbiter Circuits, IEEE Transactions on Computers, v.22 n.4, p.421-422, April 1973 [doi>10.1109/T-C.1973.223730]
• 3: Denning, P. The arbitration problem. American Scientist 73 (Nov.--Dec. 1985), 516--518.
• 4: Ran Ginosar, Fourteen Ways to Fool Your Synchronizer, Proceedings of the 9th International Symposium on Asynchronous Circuits and Systems, p.89, May 12-15, 2003
• 5: Great Principles Web site; cs.gmu.edu/cne/pjd/ GP.
• 6: Kinniment, D.J. and Woods, J.V. Synchronization and arbitration circuits in digital systems. IEE Proceedings 123, 10 (Oct. 1976), 961--966.
• 7: Lamport, L. Buridan's Principle. Technical report (1984); research.microsoft.com/users/ lamport/pubs/buridan.pdf.
• 8: Seitz, C.L. System timing, chapter 7 in Introduction to VLSI Systems (C. Mead and L. Conway, Eds.), Addison-Wesley, 1980, 218--262.
• 9: Sutherland, I. and Ebergen, J. Computers without clocks. Scientific American (Aug. 2002), 62--69; research.sun.com/async/Publications/ KPDisclosed/SciAm/SciAm.pdf.

INDEX TERMS

Primary Classification:
  D. Software
  D.4 OPERATING SYSTEMS
      D.4.1 Process Management

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.9 Management
  D.4 OPERATING SYSTEMS
      D.4.2 Storage Management