2026-06-28T20:22:30Zhttps://docta.ucm.es/rest/oai/request

oai:docta.ucm.es:20.500.14352/250002024-08-21T12:10:25Zcom_20.500.14352_14col_20.500.14352_20

00925njm 22002777a 4500 dc Albert Albiol, Elvira María author Correas Fernández, Jesús author Johnsen, Einar Broch author Román Díez, Guillermo author 2015-09 We present a novel static analysis to infer the parallel cost of distributed systems. Parallel cost differs from the standard notion of serial cost by exploiting the truly concurrent execution model of distributed processing to capture the cost of synchronized tasks executing in parallel. It is challenging to analyze parallel cost because one needs to soundly infer the parallelism between tasks while accounting for waiting and idle processor times at the different locations. Our analysis works in three phases: (1) It first performs a block-level analysis to estimate the serial costs of the blocks between synchronization points in the program; (2) Next, it constructs a distributed ow graph (DFG) to capture the parallelism, the waiting and idle times at the locations of the distributed system; Finally, (3) the parallel cost can be obtained as the path of maximal cost in the DFG. A prototype implementation demonstrates the accuracy and feasibility of the proposed analysis. https://hdl.handle.net/20.500.14352/25000 http://link.springer.com/chapter/10.1007/978-3-662-48288-9_16 Parallel Cost Analysis of Distributed Systems