{"status":"public","ec_funded":1,"title":"XSpeed: Accelerating reachability analysis on multi-core processors","type":"conference","month":"11","date_published":"2015-11-28T00:00:00Z","date_created":"2018-12-11T11:52:37Z","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","scopus_import":1,"series_title":"Lecture Notes in Computer Science","project":[{"name":"Quantitative Reactive Modeling","call_identifier":"FP7","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","name":"Moderne Concurrency Paradigms","call_identifier":"FWF"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"abstract":[{"text":"We present XSpeed a parallel state-space exploration algorithm for continuous systems with linear dynamics and nondeterministic inputs. The motivation of having parallel algorithms is to exploit the computational power of multi-core processors to speed-up performance. The parallelization is achieved on two fronts. First, we propose a parallel implementation of the support function algorithm by sampling functions in parallel. Second, we propose a parallel state-space exploration by slicing the time horizon and computing the reachable states in the time slices in parallel. The second method can be however applied only to a class of linear systems with invertible dynamics and fixed input. A GP-GPU implementation is also presented following a lazy evaluation strategy on support functions. The parallel algorithms are implemented in the tool XSpeed. We evaluated the performance on two benchmarks including an 28 dimension Helicopter model. Comparison with the sequential counterpart shows a maximum speed-up of almost 7× on a 6 core, 12 thread Intel Xeon CPU E5-2420 processor. Our GP-GPU implementation shows a maximum speed-up of 12× over the sequential implementation and 53× over SpaceEx (LGG scenario), the state of the art tool for reachability analysis of linear hybrid systems. Experiments illustrate that our parallel algorithm with time slicing not only speeds-up performance but also improves precision.","lang":"eng"}],"intvolume":"      9434","citation":{"ista":"Ray R, Gurung A, Das B, Bartocci E, Bogomolov S, Grosu R. 2015. XSpeed: Accelerating reachability analysis on multi-core processors. 9434, 3–18.","short":"R. Ray, A. Gurung, B. Das, E. Bartocci, S. Bogomolov, R. Grosu, 9434 (2015) 3–18.","ama":"Ray R, Gurung A, Das B, Bartocci E, Bogomolov S, Grosu R. XSpeed: Accelerating reachability analysis on multi-core processors. 2015;9434:3-18. doi:<a href=\"https://doi.org/10.1007/978-3-319-26287-1_1\">10.1007/978-3-319-26287-1_1</a>","chicago":"Ray, Rajarshi, Amit Gurung, Binayak Das, Ezio Bartocci, Sergiy Bogomolov, and Radu Grosu. “XSpeed: Accelerating Reachability Analysis on Multi-Core Processors.” Lecture Notes in Computer Science. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-26287-1_1\">https://doi.org/10.1007/978-3-319-26287-1_1</a>.","ieee":"R. Ray, A. Gurung, B. Das, E. Bartocci, S. Bogomolov, and R. Grosu, “XSpeed: Accelerating reachability analysis on multi-core processors,” vol. 9434. Springer, pp. 3–18, 2015.","apa":"Ray, R., Gurung, A., Das, B., Bartocci, E., Bogomolov, S., &#38; Grosu, R. (2015). XSpeed: Accelerating reachability analysis on multi-core processors. Presented at the HVC: Haifa Verification Conference, Haifa, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-319-26287-1_1\">https://doi.org/10.1007/978-3-319-26287-1_1</a>","mla":"Ray, Rajarshi, et al. <i>XSpeed: Accelerating Reachability Analysis on Multi-Core Processors</i>. Vol. 9434, Springer, 2015, pp. 3–18, doi:<a href=\"https://doi.org/10.1007/978-3-319-26287-1_1\">10.1007/978-3-319-26287-1_1</a>."},"author":[{"last_name":"Ray","full_name":"Ray, Rajarshi","first_name":"Rajarshi"},{"last_name":"Gurung","full_name":"Gurung, Amit","first_name":"Amit"},{"last_name":"Das","full_name":"Das, Binayak","first_name":"Binayak"},{"first_name":"Ezio","last_name":"Bartocci","full_name":"Bartocci, Ezio"},{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","first_name":"Sergiy","last_name":"Bogomolov","full_name":"Bogomolov, Sergiy"},{"full_name":"Grosu, Radu","last_name":"Grosu","first_name":"Radu"}],"department":[{"_id":"ToHe"}],"alternative_title":["LNCS"],"publication_status":"published","day":"28","year":"2015","volume":9434,"publisher":"Springer","language":[{"iso":"eng"}],"date_updated":"2020-08-11T10:09:17Z","conference":{"start_date":"2015-11-17","location":"Haifa, Israel","end_date":"2015-11-19","name":"HVC: Haifa Verification Conference"},"_id":"1541","doi":"10.1007/978-3-319-26287-1_1","publist_id":"5630","acknowledgement":"This work was supported in part by the European Research Council (ERC) under grant 267989 (QUAREM) and by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award).","page":"3 - 18"}