Optimality Results for Multiprocessor Real-Time Locking
When locking protocols are used in real-time systems, bounds on blocking times are required when ensuring timing constraints. While the term blocking" is well-understood in the context of uniprocessor real-time systems, the same is not true in the multiprocessor case. In this talk, two definitions of blocking are presented that are applicable to suspension-based multiprocessor locking protocols. The need for two definitions arises because of differences in how suspensions are handled in existing schedulability analysis. For each definition, locking protocols are presented that have asymptotically optimal blocking behavior. In particular, protocols are presented for any job-level static-priority global or partitioned scheduling algorithm. "
Björn Brandenburg is a graduate student in the Department of Computer Science at the University of North Carolina at Chapel Hill (UNC). He received his undergraduate education from the Technische Universität Berlin and transferred to UNC on a Fulbright Fellowship in 2006. He received an M.S. degree in Computer Science from UNC in 2008 and expects to defend his dissertation in August 2011. His research interests include multiprocessor real-time system, real-time synchronization protocols, and operating systems.