Presentation is loading. Please wait.

Presentation is loading. Please wait.

PEREGRINE: Efficient Deterministic Multithreading through Schedule Relaxation Heming Cui, Jingyue Wu, John Gallagher, Huayang Guo, Junfeng Yang Software.

Published byFatima Wigg Modified over 10 years ago

Similar presentations

Presentation on theme: "PEREGRINE: Efficient Deterministic Multithreading through Schedule Relaxation Heming Cui, Jingyue Wu, John Gallagher, Huayang Guo, Junfeng Yang Software."— Presentation transcript:

1 PEREGRINE: Efficient Deterministic Multithreading through Schedule Relaxation Heming Cui, Jingyue Wu, John Gallagher, Huayang Guo, Junfeng Yang Software Systems Lab Columbia University 1

2 Nondeterminism in Multithreading Different runs different behaviors, depending on thread schedules Complicates a lot of things – Understanding – Testing – Debugging –…–… 2

3 3 Thread 0Thread 1 Apache Bug #21287 Thread 0Thread 1 mutex_lock(M) *obj = … mutex_unlock(M) mutex_lock(M) free(obj) mutex_unlock(M) mutex_lock(M) *obj = … mutex_unlock(M) mutex_lock(M) free(obj) mutex_unlock(M) Nondeterministic Synchronization Thread 0Thread 1 FFT in SPLASH2 …… barrier_wait(B) print(result) …… barrier_wait(B) result += … Thread 0Thread 1 …… barrier_wait(B) print(result) …… barrier_wait(B) result += … Data Race

4 Deterministic Multithreading (DMT) Same input same schedule – Addresses many problems due to nondeterminism Existing DMT systems enforce either of – Sync-schedule: deterministic total order of synch operations (e.g., lock()/unlock()) – Mem-schedule: deterministic order of shared memory accesses (e.g., load/store) 4

5 Thread 0Thread 1 FFT in SPLASH2 …… barrier_wait(B) print(result) …… barrier_wait(B) result += … Thread 0Thread 1 …… barrier_wait(B) print(result) …… barrier_wait(B) result += … Sync-schedule [TERN OSDI '10], [Kendo ASPLOS '09], etc Pros: efficient (16% overhead in Kendo) Cons: deterministic only when no races – Many programs contain races [Lu ASPLOS '08] 5 Thread 0Thread 1 Apache Bug #21287 Thread 0Thread 1 mutex_lock(M) *obj = … mutex_unlock(M) mutex_lock(M) free(obj) mutex_unlock(M) mutex_lock(M) *obj = … mutex_unlock(M) mutex_lock(M) free(obj) mutex_unlock(M)

6 Mem-schedule [COREDET ASPLOS '10], [dOS OSDI '10], etc Pros: deterministic despite of data races Cons: high overhead (e.g., 1.2~10.1X slowdown in dOS) 6 Thread 0Thread 1 FFT in SPLASH2 …… barrier_wait(B) print(result) …… barrier_wait(B) result += … Thread 0Thread 1 …… barrier_wait(B) print(result) …… barrier_wait(B) result += …

7 Open Challenge [WODET '11] Either determinism or efficiency, but not both 7 Type of ScheduleDeterminismEfficiency Sync Mem Can we get both?

8 Yes, we can! 8 Type of ScheduleDeterminismEfficiency Sync Mem PEREGRINE

9 PEREGRINE Insight Races rarely occur – Intuitively, many races already detected – Empirically, six real apps up to 10 races occured Hybrid schedule – Sync-schedule in race-free portion (major) – Mem-schedule in racy portion (minor) 9

10 PEREGRINE: Efficient DMT Schedule Relaxation – Record execution trace for new input – Relax trace into hybrid schedule – Reuse on many inputs: deterministic + efficient Reuse rate is high (e.g., 90.3% for Apache, [TERN OSDI '10]) Automatic using new program analysis techniques Run in Linux, user space Handle Pthread synchronization operations Work with server programs [TERN OSDI '10] 10

11 Summary of Results Evaluated on a diverse set of 18 programs – 4 real applications: Apache, PBZip2, aget, pfscan – 13 scientific programs (10 from SPLASH2, 3 from PARSEC) – Racey (popular stress testing tool for DMT) Deterministically resolve all races Efficient: 54% faster to 49% slower Stable: frequently reuse schedules for 9 programs – Many benefits: e.g., reuse good schedules [TERN OSDI '10] 11

12 Outline PEREGRINE overview An example Evaluation Conclusion 12

13 PEREGRINE Overview Instrumentor LLVM Recorder OS Program Schedule Cache 13 INPUT Program Source MissHit Execution Traces … INPUT, Si INPUT Replayer OS Program Analyzer Match?

14 Outline PEREGRINE overview An example Evaluation Conclusion 14

15 15 An Example main(argc, char *argv[]) { nthread = atoi(argv[1]); size = atoi(argv[2]); for(i=1; i<nthread; ++i) pthread_create(worker); worker(); if ((flag=atoi(argv[3]))==1) result += …; printf(%d\n, result); } worker() { char *data; data = malloc(size/nthread); for(i=0; i<size/nthread; ++i) data[i] = myRead(i); pthread_mutex_lock(&mutex); result += …; pthread_mutex_unlock(&mutex); } // Read input. // Create children threads. // Read from result. // Write to result. // Allocate data with size/nthread. // Read data from disk and compute. // Grab mutex. // Work. // Missing pthread_join() // if flag is 1, update result.

16 16 Instrumentor main(argc, char *argv[]) { nthread = atoi(argv[1]); size = atoi(argv[2]); for(i=1; i<nthread; ++i) pthread_create(worker); worker(); // Missing pthread_join() if ((flag=atoi(argv[3]))==1) result += …; printf(%d\n, result); } worker() { char *data; data = malloc(size/nthread); for(i=0; i<size/nthread; ++i) data[i] = myRead(i); pthread_mutex_lock(&mutex); result += …; pthread_mutex_unlock(&mutex); } // Instrument command line arguments. // Instrument read() function within myRead().

17 17 Instrumentor main(argc, char *argv[]) { nthread = atoi(argv[1]); size = atoi(argv[2]); for(i=1; i<nthread; ++i) pthread_create(worker); worker(); // Missing pthread_join() if ((flag=atoi(argv[3]))==1) result += …; printf(%d\n, result); } worker() { char *data; data = malloc(size/nthread); for(i=0; i<size/nthread; ++i) data[i] = myRead(i); pthread_mutex_lock(&mutex); result += …; pthread_mutex_unlock(&mutex); } // Instrument command line arguments. // Instrument read() function. // Instrument synchronization operation.

18 18 $./a.out 2 2 0 Recorder main(argc, char *argv[]) { nthread = atoi(argv[1]); size = atoi(argv[2]); for(i=1; i<nthread; ++i) pthread_create(worker); worker(); // Missing pthread_join() if ((flag=atoi(argv[3]))==1) result += …; printf(%d\n, result); } worker() { char *data; data = malloc(size/nthread); for(i=0; i<size/nthread; ++i) data[i] = myRead(i); pthread_mutex_lock(&mutex); result += …; pthread_mutex_unlock(&mutex); } Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() printf(…,result)

19 19 $./a.out 2 2 0 Recorder Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() printf(…,result)

20 20 Analyzer: Hybrid Schedule Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() pthread_create() lock() unlock() lock() unlock() Thread 1Thread 0 printf(…,result)

21 21 Analyzer: Hybrid Schedule Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() pthread_create() lock() unlock() lock() unlock() Thread 1Thread 0 result+=…; printf(…,result)

22 22 Analyzer: Hybrid Schedule Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() pthread_create() lock() unlock() lock() unlock() Thread 1Thread 0 printf(…,result) result+=…;

23 23 Analyzer: Hybrid Schedule Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() pthread_create() lock() unlock() lock() unlock() Thread 1Thread 0 printf(…,result) result+=…; printf(…,result)

24 24 Analyzer: Precondition Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() printf(…,result) Challenges – Ensure schedule is feasible – Ensure no new races pthread_create() lock() unlock() lock() unlock() Thread 1 Thread 0 printf(…,result) result+=…;./a.out 2 2 0 Hybrid Schedule main(argc, char *argv[]) { nthread = atoi(argv[1]); size = atoi(argv[2]); for(i=1; i<nthread; ++i) pthread_create(worker); worker(); // Missing pthread_join() if ((flag=atoi(argv[3]))==1) result += …; printf(%d\n, result); } ……

25 25 Naïve Approach to Computing Preconditions Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() nthread==2 size==2 (1<nthread)==1 (2<nthread)==0 (0<size/nthread)==1 (1<size/nthread)==0 (0<size/nthread)==1 (1<size/nthread)==0 printf(…,result) (flag==1)==0 flag!=1

26 26 Analyzer: Preconditions (a Naïve Way) Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() Problem: over-constraining! – size must be 2 to reuse Absorbed most of our brain power in this paper! Solution: two new program analysis techniques; see paper nthread==2 size==2 flag!=1 printf(…,result)

27 27 Analyzer: Preconditions Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() nthread==2 (1<nthread)==1 (2<nthread)==0 (flag==1)==0 flag!=1 printf(…,result)

28 28./a.out 2 1000 3 Replayer nthread==2 flag!=1 Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() pthread_create() lock() unlock() lock() unlock() Thread 1 Thread 0 printf(…,result) result+=…; Hybrid Schedule printf(…,result) Preconditions

29 29 Benefits of PEREGRINE Thread 1 nthread=atoi() size=atoi() (1<nthread)==1 pthread_create() worker() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 (flag==1)==0 (2<nthread)==0 Thread 0 lock() result+=…; unlock() data=malloc() (0<size/nthread)==1 data[i]=myRead() (1<size/nthread)==0 lock() result+=…; unlock() main() worker() (1<nthread)==1 (2<nthread)==0 Deterministic: resolve race on result; no new data races Efficient: loops on data[] run in parallel Stable [TERN OSDI '10]: can reuse on any data size or contents Other applications possible; talk to us! printf(…,result)

30 Outline PEREGRINE overview An example Evaluation Conclusion 30

31 General Experiment Setup Program-workload – Apache: download a 100KB html page using ApacheBench – PBZip2: compress a 10MB file – Aget: download linux-3.0.1.tar.bz2, 77MB. – Pfscan: scan keyword return 100 files from gcc project – 13 scientific benchmarks (10 from SPLASH2, 3 from PARSEC): run for 1-100 ms – Racey: default workload Machine: 2.67GHz dual-socket quad-core Intel Xeon machine (eight cores) with 24GB memory Concurrency: eight threads for all experiments 31

32 Determinism Program# RacesSync- schedule Hybrid schedule Apache0 PBZip24 barnes5 fft10 lu-non-contig10 streamcluster0 racey167974 32

33 Overhead in Reusing Schedules 33

34 % of Instructions Left in the Trace 34

35 Conclusion Hybrid schedule: combine the best of both sync- schedule and mem-schedules PEREGRINE – Schedule relaxation to compute hybrid schedules – Deterministic (make all 7 racy programs deterministic) – Efficient (54% faster to 49% slower) – Stable (frequently reuse schedule for 9 out of 17) Have broad applications 35

36 Thank you! Questions? 36

Download ppt "PEREGRINE: Efficient Deterministic Multithreading through Schedule Relaxation Heming Cui, Jingyue Wu, John Gallagher, Huayang Guo, Junfeng Yang Software."

Similar presentations

Slide 1 Insert your own content. Slide 2 Insert your own content.

Slide 1 Insert your own content. Slide 2 Insert your own content.
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study Sebastian Burckhardt Rajeev Alur Milo M. K. Martin Department of.

Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study Sebastian Burckhardt Rajeev Alur Milo M. K. Martin Department of.
0 - 0.

0 - 0.
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.

MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts 1 - 20.

Addition Facts
1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.

1 Interprocess Communication 1. Ways of passing information 2. Guarded critical activities (e.g. updating shared data) 3. Proper sequencing in case of.
CS4026 Formal Models of Computation Running Haskell Programs – power.

CS4026 Formal Models of Computation Running Haskell Programs – power.
Chapter 1 Introduction Copyright © 2008. Operating Systems, by Dhananjay Dhamdhere Copyright © 20081.2 Introduction Abstract Views of an Operating System.

Chapter 1 Introduction Copyright © Operating Systems, by Dhananjay Dhamdhere Copyright © Introduction Abstract Views of an Operating System.
Triage: Diagnosing Production Run Failures at the Users Site Joseph Tucek, Shan Lu, Chengdu Huang, Spiros Xanthos, and Yuanyuan Zhou Department of Computer.

Triage: Diagnosing Production Run Failures at the Users Site Joseph Tucek, Shan Lu, Chengdu Huang, Spiros Xanthos, and Yuanyuan Zhou Department of Computer.
Concurrent Predicates: A Debugging Technique for Every Parallel Programmer PACT 13 Justin Gottschlich Gilles Pokam Cristiano Pereira Youfeng Wu Intel Corporation.

Concurrent Predicates: A Debugging Technique for Every Parallel Programmer PACT 13 Justin Gottschlich Gilles Pokam Cristiano Pereira Youfeng Wu Intel Corporation.
Computers Are Your Future Twelfth Edition Chapter 4: System Software Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall 1.

Computers Are Your Future Twelfth Edition Chapter 4: System Software Copyright © 2012 Pearson Education, Inc. Publishing as Prentice Hall 1.
Debugging operating systems with time-traveling virtual machines Sam King George Dunlap Peter Chen CoVirt Project, University of Michigan.

Debugging operating systems with time-traveling virtual machines Sam King George Dunlap Peter Chen CoVirt Project, University of Michigan.
RAMP Gold : An FPGA-based Architecture Simulator for Multiprocessors Zhangxi Tan, Andrew Waterman, David Patterson, Krste Asanovic Parallel Computing Lab,

RAMP Gold : An FPGA-based Architecture Simulator for Multiprocessors Zhangxi Tan, Andrew Waterman, David Patterson, Krste Asanovic Parallel Computing Lab,
Chapter 11 – Virtual Memory Management

Chapter 11 – Virtual Memory Management
Read-Write Lock Allocation in Software Transactional Memory Amir Ghanbari Bavarsad and Ehsan Atoofian Lakehead University.

Read-Write Lock Allocation in Software Transactional Memory Amir Ghanbari Bavarsad and Ehsan Atoofian Lakehead University.
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.

Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
3.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Process An operating system executes a variety of programs: Batch system.

3.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Process An operating system executes a variety of programs: Batch system.
1 Processes and Threads Chapter 2 2.1 Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.

1 Processes and Threads Chapter Processes 2.2 Threads 2.3 Interprocess communication 2.4 Classical IPC problems 2.5 Scheduling.
Processes Management.

Processes Management.
Executional Architecture

Executional Architecture

Similar presentations

Ads by Google