Skip to main content

The Analysis of Hardware Supported Cache Lock Mechanism Without Retry

  • Conference paper
  • 1007 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3320))

Abstract

A lock mechanism is essential for synchronization on the multiprocessor systems. This paper proposes the new locking protocol, called WPV (Waiting Processor Variable) lock mechanism. It uses the cache state lock mechanism and has only one lock-read bus traffic. This paper also derives the analytical model of WPV lock mechanism as well as conventional memory and cache queuing lock mechanisms. The simulation results on the WPV lock mechanism show that access time is reduced comparing with the memory and queuing lock mechanism as the number of processors increases.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Moon, E., Thang, S., Jhon, C.: Analysis of the Relation of Synchronization Algorithm and Parallel Programs in Shared-Memory Multiprocessor Systems. In: Proceedings of High Performance Computing Symposium (2000)

    Google Scholar 

  2. Cho, H.: Cache coherency and concurrency control in a multisystem data sharing. IEICE Transactions on Information & Systems E82-D(6), 1042–1050 (1999)

    Google Scholar 

  3. Nikolopoulos, D., Papatheodorou, S.: Fast Synchronization on Scalable Cache Coherent Multiprocessors using Hybrid. In: Proceedings of the 14th International Parallel & Distributed Processing, pp. 711–719 (2000)

    Google Scholar 

  4. Ki, A.D., Park, B.K.: Highly pipelined bus: HiPi-Bus. In: Proceedings JTC-CSCC 1991 (1991)

    Google Scholar 

  5. Yamamura, S., Hirai, A., Yamamoto, M.: Speeding Up Kernel Scheduler by Reducing Cache Misses. In: Proceedings of the Freenix Track 2002 USENIX Annual Technical Conference, pp. 275–285 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, W., Hong, C., Kim, Y. (2004). The Analysis of Hardware Supported Cache Lock Mechanism Without Retry. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_154

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30501-9_154

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24013-6

  • Online ISBN: 978-3-540-30501-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics