Skip to main content
guest
Join | Help | Sign In
chessprogramming Home
guest| Join | Help | Sign In
chessprogramming
  • Wiki Home
  • Recent Changes
  • Pages and Files
  • Members
Home
  • Basics
    • Getting Started
    • Board Representation
    • Search
    • Evaluation
  • Principle Topics
    • Chess
    • Programming
    • Artificial Intelligence
    • Knowledge
    • Learning
    • Testing
    • Tuning
    • User Interface
    • Protocols
    • Dictionary
  • Lists
    • Arts
    • Cartoons
    • CC Forums
    • Conferences
    • Dedicated CC
    • Engines
    • Games
    • Hardware
    • History
    • Organizations
    • Papers
    • People
    • Periodical
    • Samples
    • Software
    • Timeline
    • Tournaments and Matches
    • Videos
  • Misc
    • Acknowledgments
    • On New Pages
    • Recommended Reading
    • Wikispaces Help

Synchronization to include

Edit 0 10 …
  • 0 Tags
    • No tags
  • Notify
  • RSS
  • Backlinks
  • Source
  • Print
  • Export (PDF)
  • Edsger W. Dijkstra Archive:
    Cooperating sequential processes (EWD 123)
    A challenge to memory designers? (EWD 497)
  • I remember Edsger Dijkstra (1930 – 2002) « A Programmers Place by Maarten van Emden
  • Concurrency from Wikipedia
  • Category:Concurrency from Wikipedia
  • Concurrency control from Wikipedia
  • Optimistic concurrency control from Wikipedia
  • Synchronization from Wikipedia
  • Inter-process communication from Wikipedia
  • Non-blocking algorithm from Wikipedia
  • Linearizability from Wikipedia
  • Monitor (synchronization)
  • Lock from Wikipedia
  • Busy waiting from Wikipedia
  • Seqlock from Wikipedia
  • Spinlock from Wikipedia
  • Double-checked locking from Wikipedia
  • Compare-and-swap from Wikipedia
  • Test-and-set from Wikipedia
  • Test and Test-and-set from Wikipedia
  • Fetch-and-add from Wikipedia
  • Barrier from Wikipedia
  • Memory barrier from Wikipedia
  • Critical section from Wikipedia
  • Mutual exclusion from Wikipedia
  • Semaphore from Wikipedia
  • Transactional Synchronization Extensions from Wikipedia (Haswell)
  • Readers-writers problem from Wikipedia
  • Readers-writer lock from Wikipedia
  • Read-copy-update from Wikipedia
  • Producer-consumer problem from Wikipedia
  • Dining philosophers problem from Wikipedia
  • Cigarette smokers problem from Wikipedia
  • Sleeping barber problem from Wikipedia
  • Resource starvation from Wikipedia
  • Deadlock from Wikipedia
  • Anatomy of Linux synchronization methods by M. Tim Jones, IBM developerWorks, October 31, 2007
  • The Little Book of Semaphores by Allen B. Downey

help on how to format text

Help · About · Pricing · Privacy · Terms · Support · Upgrade
Contributions to https://chessprogramming.wikispaces.com/ are licensed under a Creative Commons Attribution Share-Alike 3.0 License. Creative Commons Attribution Share-Alike 3.0 License
Portions not contributed by visitors are Copyright 2018 Tangient LLC
TES: The largest network of teachers in the world
Turn off "Getting Started"
  1. Home
  2. ...
Loading...