Skip to main content
USENIX
  • Conferences
  • Students
Sign in

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @LISAConference

usenix conference policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

You are here

Home ยป Adaptive Locks for Frequently Scheduled Tasks With Unpredictable Runtimes
Tweet

connect with us

Adaptive Locks for Frequently Scheduled Tasks With Unpredictable Runtimes

Authors: 

Mark Burgess & Demosthenes Skipitaris, Oslo College

Abstract: 

We present a form of discretionary lock which is designed to render unreliable but frequently scheduled scripts or programs predictable even when the execution time of locked operations may grow and exceed their expected scheduling interval. We implement our locking policy with lock-unlock semantics and test them on the system administration language cfengine. The locks are controlled by too-soon and too-late parameters so that execution times can be controlled within fixed bounds even when scheduling requests occur randomly in addition to the periodic scheduling time. This has the added bonus of providing an anti-spamming functionality.

Mark Burgess, Oslo College

Demosthenes Skipitaris, Oslo College

Links

Paper: 
https://www.usenix.org/legacy/publications/library/proceedings/lisa97/full_papers/15.burgess/15.pdf
Paper (HTML): 
https://www.usenix.org/legacy/publications/library/proceedings/lisa97/full_papers/15.burgess/15_html/main.html
  • Log in or    Register to post comments

© USENIX

  • Privacy Policy
  • Contact Us