2014/05/17 by Mohamed A. El-Zawawy, El-Zawawy, Mohamed A., Mohammad N. Alanazi +1
Computer Science · #Cloud Computing and Resource Management #Distributed systems and fault tolerance #FOS: Computer and information sciences #Parallel Computing and Optimization Techniques #Real-Time Systems Scheduling #Software Engineering (cs.SE) #Software System Performance and Reliability #cs.SE
paper · pdf · doi:10.48550/arxiv.1405.4399
6 pages, 5 figures
arxiv created 2014/05/17 · openalex publication_date 2014/05/17 · arxiv updated 2014/05/20 · openalex created_date 2022/10/07 · openalex updated_date 2026/07/28
Execution of concurrent programs implies frequent switching between different thread contexts. This property perplexes analyzing and reasoning about concurrent programs. Trace simplification is a technique that aims at alleviating this problem via transforming a concurrent program trace (execution) into a semantically equivalent one. The resulted trace typically includes less number of context switches than that in the original trace. This paper presents a new static approach for trace simplification. This approach is based on a connectivity analysis that calculates for each trace-point connectivity and context-switching information. The paper also presents a novel operational semantics for concurrent programs. The semantics is used to prove the correctness and efficiency of the proposed techniques for connectivity analysis and trace simplification. The results of experiments testing the proposed technique on problems treated by previous work for trace simplification are also shown in the paper. The results prove the efficiency and effectiveness of the proposed method.