Skip to main content
SpringerLink
Log in

A new explanation of the glitch phenomenon

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We consider a discrete model for asynchronous circuits and show that, under very mild restrictions, this model excludes the existence of glitch-free arbiters. This result contradicts a long standing conjecture that the nonexistence of glitch-free arbiters is due to the continuous nature of such circuits.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Black, D.: On the existence of delay-insensitive fair arbiters: trace theory and its limitations. Distrib. Comput.,1, 205–225 (1986)

    Google Scholar 

  2. Chandy, K., Misra, J.: How processes learn. Distrib. Comput.1, 40–52 (1986)

    Google Scholar 

  3. Chandy, K., Misra, J.: Parallel program design: A foundation, pp. 89–94. Reading, MA: Addison Wesley 1988

    Google Scholar 

  4. Chaney, T., Molnar, C.: Anomalous behavior of synchronizer and arbiter circuits. IEEE Trans. Comput. C22, 421–422 (1973)

    Google Scholar 

  5. Fischer, M., Lynch, N., Patterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM.32, 374–382 (1985)

    Google Scholar 

  6. Hurtado, M., Elliot, D.: Ambiguous behavior of logic bistable systems. Proceedings of the 13th Annual Allerton Conference on Circuit and Systems Theory, October 1975, pp. 605–611

  7. Lamport, L.: Buridan's principle. SRI Technical Report. October 1984

  8. Marino, L.: General theory of metastable operation. IEEE Trans. Comput., C30, 107–115 (1981)

    Google Scholar 

  9. Martin, A.: Compiling communicating processes into delay-insensitive VLSI circuits. Distrib. Comput.1, 226–234 (1986)

    Google Scholar 

  10. Miller, R.: Speed independent switching circuit theory. In: Switching theory. Sequential circuits and machines, Vol. 2, Chap. 10. New York: Wiley 1965

    Google Scholar 

  11. Palais, R., Lamport, L.: On the glitch phenomenon. Technical report CA-7611-0811, Massachusetts Computer Associates, Wakefield, Massachusetts, November 1976

    Google Scholar 

  12. Seitz, C.: System timing. In: Mead, C., Conway, L. (eds.). Introduction to VLSI systems, Chap. 7. Reading, MA: Addison-Wesley 1980

    Google Scholar 

  13. Udding, J.: A formal model for defining and classifying delay-insensitive circuits and systems. Distrib. Comput.1, 197–204 (1986)

    Google Scholar 

  14. Vosbury, M.: Hazards in asynchronous sequential circuits due to unrestricted input changes. Ph. D. dissertation, Rensselaer Polytechnic Institute, Troy, New York, December 1973

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Maryland at College Park, 20742, College Park, MD, USA

    James H. Anderson

  2. Department of Computer Sciences, The University of Texas at Austin, 78712-1188, Austin, TX, USA

    Mohamed G. Gouda

Authors
  1. James H. Anderson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohamed G. Gouda
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Work supported in part by Office of Naval Research Contract N00014-89-J-1913

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anderson, J.H., Gouda, M.G. A new explanation of the glitch phenomenon. Acta Informatica 28, 297–309 (1991). https://doi.org/10.1007/BF01893884

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01893884

Keywords

Search

Navigation