Back to Results
First PageMeta Content
Mathematics / Mutual exclusion / Algorithm / Non-blocking algorithm / Parallel computing / Test-and-set / Semaphore / Distributed computing / Critical section / Concurrency control / Computing / Computer programming


Document Date: 2008-02-15 23:32:19

Open Document

Share Result on Facebook

City

Cambridge / Los Alamitos / Troy / Jerusalem / St. Malo / /

Company

IEEE Computer Society Press / MIT Press / /

Country

France / Israel / /

Currency

pence / /

Facility

Mutual Exclusion Revisited† Boleslaw K. Szymanski Computer Science Department Rensselaer Polytechnic Institute / University of Toronto / /

IndustryTerm

mutual exclusion algorithms / shorter and simpler algorithm / weaker solution / individual processors / self-stabilizing algorithm / fair mutual exclusion algorithms / distributed processing / uniform solution / uniprocessor systems / equivalent published mutual exclusion algorithms / chip processors / linear wait algorithm / multiprocessor systems / starvation-free solution / shorter solution / large distributed systems / algorithmic solutions / basic algorithm / mutual exclusion algorithm / /

Organization

Army Research Office / National Science Foundation / Rensselaer Polytechnic Institute / MIT / University of Toronto / /

Person

Amir Pnueli / /

Position

author / /

ProvinceOrState

New York / California / Massachusetts / /

RadioStation

Wait / /

Technology

equivalent published mutual exclusion algorithms / one three-bit self-stabilizing algorithm / VLSI chip / Information Technology / two processors / four mutual exclusion algorithms / published algorithms / large VLSI chip processors / fair mutual exclusion algorithms / last algorithm / third algorithm / mutual exclusion algorithm / shared memory / linear wait algorithm / shorter and simpler algorithm / two algorithms / basic algorithm / presented algorithm / presented algorithms / /

SocialTag