Back to Results
First PageMeta Content
Software engineering / Lock / Spinlock / Scheduling / Critical section / Monitor / Linearizability / Parallel computing / Concurrency control / Computing / Computer programming


Preemption Adaptivity in Time-Published Queue-Based Spin Locks∗ Bijun He, William N. Scherer III, and Michael L. Scott Technical Report #867 Department of Computer Science University of Rochester
Add to Reading List

Document Date: 2005-05-17 12:41:36


Open Document

File Size: 375,15 KB

Share Result on Facebook

City

Published Queue / /

Company

IBM / SmartQ / Sun Microsystems Laboratories / MCS / /

/

Facility

Computer Science University of Rochester Rochester / /

IndustryTerm

timeout protocol / cache-coherent hardware / user applications / timeout protocols / timeout algorithms / on-line servers / /

OperatingSystem

Unix / AIX / /

Organization

National Science Foundation / Computer Science University of Rochester Rochester / /

Person

Michael L. Scott / Strict / Figure / William N. Scherer III / /

Position

synthetic scheduler / Prime Minister / Mach scheduler / waiter / scheduler / CLH-PM / first active waiter / head / tracing garbage collector / /

ProgrammingLanguage

C / /

Technology

NB timeout algorithms / timeout protocol / TP algorithms / 2 Algorithms / Unix / API / one dedicated processor / 32 1.3GHz Power4 processors / operating system / shared memory / operating systems / two algorithms / nonblocking timeout protocols / /

SocialTag