国外操作系统相关论文《Stable Deterministic Multithreading through Schedule Memoization》.pdfVIP

Stable Deterministic Multithreading through Schedule Memoization Heming Cui, Jingyue Wu, Chia-che Tsai, Junfeng Yang {heming, jingyue, ct2459, junfeng}@ Computer Science Department Columbia University New York, NY 10027 Abstract ever, frequently input nondeterminism is not essential A deterministic multithreading (DMT) system eliminates and the same schedule can be used to process many dif- nondeterminism in thread scheduling, simplifying the ferent inputs (§2.2). We believe nonessential nondeter- minism should be eliminated in favor of determinism. development of multithreaded programs. However, ex- isting DMT systems are unstable; they may force a pro- Deterministic multithreading (DMT) systems [13, 22, gram to (ad)venture into vastly different schedules even 41] make threads more deterministic by eliminating for slightly different inputs or execution environments, scheduling nondeterminism. Specifically, they constrain defeating many benefits of determinism. Moreover, few a multithreaded program such that it always uses the existing DMT systems work with server programs whose same thread schedule for the same input. By doing so, inputs arrive continuously and nondeterministically. these systems make program behaviors repeatable, in- TERN is a stable DMT system. The key novelty in crease testing confidence, and ease bug reproduction. TERN is the idea of schedule memoization that memo- Unfortunately, though existing DMT systems elimi- izes past working sc