A General Framework for Static Cost Analysis of Parallel Logic Programs

Abstract

The estimation and control of resource usage is now an important challenge in an increasing number of computing systems. In particular, requirements on timing and energy arise in a wide variety of applications such as internet of things, cloud computing, health, transportation, and robots. At the same time, parallel computing, with (heterogeneous) multicore platforms in particular, has become the dominant paradigm in computer architecture. Predicting resource usage on such platforms poses a difficult challenge. Most work on static resource analysis has focused on sequential programs, and relatively little progress has been made on the analysis of parallel programs, or more specifically on parallel logic programs. We propose a novel, general, and flexible framework for setting up cost equations/relations which can be instantiated for performing resource usage analysis of parallel logic programs for a wide range of resources, platforms and execution models. The analysis estimates both lower and upper bounds on the resource usage of a parallel program (without executing it) as functions on input data sizes. In addition, it also infers other meaningful information to better exploit and assess the potential and actual parallelism of a system. We develop a method for solving cost relations involving the max function that arise in the analysis of parallel programs. Finally, we instantiate our general framework for the analysis of logic programs with Independent And-Parallelism, report on an implementation within the CiaoPP system, and provide some experimental results. To our knowledge, this is the first approach to the cost analysis of parallel logic programs.

Analysing Parallel Complexity of Term Rewriting

“…For logic programs, which -like TRSs -express an implicit parallelism, parallel complexity can be inferred using recurrence solving [32].…”

“…Automated inference of complexity bounds for parallel computation has seen a surge of attention in recent years [12,13,32,5,31,18]. While techniques and tools for a variety of computational models have been introduced, so far there does not seem to be any paper in this area for complexity of term rewriting with parallel evaluation strategies.…”

Cost Analysis of Smart Contracts Via Parametric Resource Analysis

“…This analysis was extended to be fully based on abstract interpretation [12] and integrated into the PLAI multi-variant framework, leading to contextsensitive resource analyses [59]. Other extensions include static profiling [43], static bounding of run-time checking overhead [38], or analysis of parallel programs [37]. Other applications include the previously mentioned analyses of platform-dependent properties such as time or energy [39][40][41][42]47,50,51].…”

A General Framework for Static Resource Analysis and Profiling of (Parallel) Programs and an Application to Runtime Checking

“…In particular, we have proposed a novel, general, and flexible framework for setting up cost equations/relations that can be instantiated for performing resource usage analysis of both sequential and parallel (logic) programs for a wide range of resources, platforms and execution models. These results have been published in [64].…”