The Experts below are selected from a list of 1431 Experts worldwide ranked by ideXlab platform
Nan Guan - One of the best experts on this subject based on the ideXlab platform.
-
Scope-aware data cache analysis for OpenMP programs on multi-core processors
Journal of Systems Architecture, 2019Co-Authors: He Du, Wei Zhang, Nan Guan, Wang YiAbstract:Abstract OpenMP is the de facto standard parallel programming framework on shared memory architectures, which is not only widely used in general and high-performance computing but also draws increasing interests for real-time embedded systems. Choosing the appropriate assignment of loop iterations to threads is one of the most critical decisions when parallelizing loops, especially considering the large impact by caches behaviors to the program execution time. In this paper, we study data cache analysis for OpenMP programs with parallel loops. We first present a method considering the impact of the schedule clause in OpenMP programs on cache behavior. We capture the dynamic behavior of memory access by computing its Temporal Scope (the loop iterations where a given memory block is accessed for a given data reference) during address analysis. Based on the ACS representation, we present a Temporal Scope aware data cache miss calculation technique. Through the experimental result, we propose a convenient way to choose an appropriate parallelization scheme for OpenMP programs.
-
Scope-Aware Useful Cache Block Analysis for Data Cache Related Preemption Delay
2017 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2017Co-Authors: Wei Zhang, Fan Gong, Lei Ju, Nan GuanAbstract:Static timing analysis is crucial for design of realtime systems. While the worst-case execution time of a task is typically computed or measured in a single task environment, the presence of caches imposes additional cache related preemption delay (CRPD) cost to the lower priority tasks in a preemptive multi-tasking system. In this work, we show that existing instruction CRPD analysis techniques cannot be straightforwardly extended for safe and precise data CRPD analysis. In order to capture the dynamic behavior of the data memory references, we introduce the notion of Temporal Scopes into the abstract cache state (ACS) to capture the data memory blocks that must or may reside in the cache during certain time intervals of program execution. Based on the improved ACS representation, we present a Temporal Scope aware useful cache block (UCB) calculation for safe and tight estimation of the data CRPD cost. Experimental results show that the proposed technique leads to substantially tighter CRPD estimation, and is applicable to programs with complex data reference patterns.
-
RTAS - Scope-Aware Useful Cache Block Analysis for Data Cache Related Preemption Delay
2017 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2017Co-Authors: Wei Zhang, Fan Gong, Lei Ju, Nan GuanAbstract:Static timing analysis is crucial for design of realtime systems. While the worst-case execution time of a task is typically computed or measured in a single task environment, the presence of caches imposes additional cache related preemption delay (CRPD) cost to the lower priority tasks in a preemptive multi-tasking system. In this work, we show that existing instruction CRPD analysis techniques cannot be straightforwardly extended for safe and precise data CRPD analysis. In order to capture the dynamic behavior of the data memory references, we introduce the notion of Temporal Scopes into the abstract cache state (ACS) to capture the data memory blocks that must or may reside in the cache during certain time intervals of program execution. Based on the improved ACS representation, we present a Temporal Scope aware useful cache block (UCB) calculation for safe and tight estimation of the data CRPD cost. Experimental results show that the proposed technique leads to substantially tighter CRPD estimation, and is applicable to programs with complex data reference patterns.
Wei Zhang - One of the best experts on this subject based on the ideXlab platform.
-
Scope-aware data cache analysis for OpenMP programs on multi-core processors
Journal of Systems Architecture, 2019Co-Authors: He Du, Wei Zhang, Nan Guan, Wang YiAbstract:Abstract OpenMP is the de facto standard parallel programming framework on shared memory architectures, which is not only widely used in general and high-performance computing but also draws increasing interests for real-time embedded systems. Choosing the appropriate assignment of loop iterations to threads is one of the most critical decisions when parallelizing loops, especially considering the large impact by caches behaviors to the program execution time. In this paper, we study data cache analysis for OpenMP programs with parallel loops. We first present a method considering the impact of the schedule clause in OpenMP programs on cache behavior. We capture the dynamic behavior of memory access by computing its Temporal Scope (the loop iterations where a given memory block is accessed for a given data reference) during address analysis. Based on the ACS representation, we present a Temporal Scope aware data cache miss calculation technique. Through the experimental result, we propose a convenient way to choose an appropriate parallelization scheme for OpenMP programs.
-
Scope-Aware Useful Cache Block Analysis for Data Cache Related Preemption Delay
2017 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2017Co-Authors: Wei Zhang, Fan Gong, Lei Ju, Nan GuanAbstract:Static timing analysis is crucial for design of realtime systems. While the worst-case execution time of a task is typically computed or measured in a single task environment, the presence of caches imposes additional cache related preemption delay (CRPD) cost to the lower priority tasks in a preemptive multi-tasking system. In this work, we show that existing instruction CRPD analysis techniques cannot be straightforwardly extended for safe and precise data CRPD analysis. In order to capture the dynamic behavior of the data memory references, we introduce the notion of Temporal Scopes into the abstract cache state (ACS) to capture the data memory blocks that must or may reside in the cache during certain time intervals of program execution. Based on the improved ACS representation, we present a Temporal Scope aware useful cache block (UCB) calculation for safe and tight estimation of the data CRPD cost. Experimental results show that the proposed technique leads to substantially tighter CRPD estimation, and is applicable to programs with complex data reference patterns.
-
RTAS - Scope-Aware Useful Cache Block Analysis for Data Cache Related Preemption Delay
2017 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2017Co-Authors: Wei Zhang, Fan Gong, Lei Ju, Nan GuanAbstract:Static timing analysis is crucial for design of realtime systems. While the worst-case execution time of a task is typically computed or measured in a single task environment, the presence of caches imposes additional cache related preemption delay (CRPD) cost to the lower priority tasks in a preemptive multi-tasking system. In this work, we show that existing instruction CRPD analysis techniques cannot be straightforwardly extended for safe and precise data CRPD analysis. In order to capture the dynamic behavior of the data memory references, we introduce the notion of Temporal Scopes into the abstract cache state (ACS) to capture the data memory blocks that must or may reside in the cache during certain time intervals of program execution. Based on the improved ACS representation, we present a Temporal Scope aware useful cache block (UCB) calculation for safe and tight estimation of the data CRPD cost. Experimental results show that the proposed technique leads to substantially tighter CRPD estimation, and is applicable to programs with complex data reference patterns.
Laura Nasse - One of the best experts on this subject based on the ideXlab platform.
-
The Temporal Scope of the European Succession Regulation and the (in-)validity of joint wills under polish law. Commentary on the judgment of the Schleswig Higher Regional Court of 25 april 2016, 3 wx 122/15 = El ámbito Temporal del Reglamento Europ
CUADERNOS DE DERECHO TRANSNACIONAL, 2018Co-Authors: Laura NasseAbstract:Abstract: The European Succession Regulation (Regulation (EU) No 650/2012) entered into force on 16 August 2012 and applies since 17 August 2015. To facilitate the application of the Regulation, the German legislator introduced a “Law on International Succession Law and the Amendment of Provisions on Certificates of Inheritance and other areas”. One aspect of the new German law is the amendment of Article 25 of the Introductory Act to the German Civil Code (EGBGB) which now provides that chapter III of the Succession Regulation shall also apply to successions that do not fall within the Regulation’s Scope of application. In its decision, the Schleswig Higher Regional Court found that Article 25 EGBGB only extends the material but not the Temporal Scope of the Regulation. Furthermore, it discussed the characterization of the Polish prohibition of joint wills and found that the joint will of a Polish citizen who had been living in Germany is valid under the applicable German law.Keywords: European Succession Regulation, Temporal Scope, prohibition of joint wills, applicable law, choice of law.Resumen: El Reglamento europeo de sucesiones (Reglamento (UE) nº 650/2012) entró en vigor el 16 de agosto de 2012 y se aplica desde el 17 de agosto de 2015. Para facilitar la aplicación del Reglamento, el legislador alemán introdujo una “Ley de derecho sucesorio internacional y la enmienda de las Disposiciones sobre Certificados de Herencia y otras áreas “. Un aspecto de la nueva ley alemana es la modificación del artículo 25 de la Ley introductoria del Código Civil alemán (EGBGB) que establece que el capítulo III del Reglamento de Sucesiones se aplicará también a las sucesiones que no entran en el ámbito de aplicación del Reglamento. . En su decisión, el Tribunal Regional Superior de Schleswig consideró que el artículo 25 EGBGB solo extiende el alcance material pero no Temporal del Reglamento. Además, discutió la caracterización de la prohibición polaca de voluntades conjuntas y encontró que la voluntad conjunta de un ciudadano polaco que había estado viviendo en Alemania es válida bajo la ley alemana aplicable.Palabras clave: Reglamento europeo de sucesiones, ámbito Temporal, prohibición de voluntades cojuntas, ley applicable, elección de ley.
-
the Temporal Scope of the european succession regulation and the in validity of joint wills under polish law commentary on the judgment of the schleswig higher regional court of 25 april 2016 3 wx 122 15
Cuadernos de derecho transnacional, 2018Co-Authors: Laura NasseAbstract:espanolEl Reglamento europeo de sucesiones (Reglamento (UE) no 650/2012) entro en vigor el 16 de agosto de 2012 y se aplica desde el 17 de agosto de 2015. Para facilitar la aplicacion del Reglamento, el legislador aleman introdujo una “Ley de derecho sucesorio internacional y la enmienda de las Disposiciones sobre Certificados de Herencia y otras areas “. Un aspecto de la nueva ley alemana es la modificacion del articulo 25 de la Ley introductoria del Codigo Civil aleman (EGBGB) que establece que el capitulo III del Reglamento de Sucesiones se aplicara tambien a las sucesiones que no entran en el ambito de aplicacion del Reglamento. . En su decision, el Tribunal Regional Superior de Schleswig considero que el articulo 25 EGBGB solo extiende el alcance material pero no Temporal del Reglamento. Ademas, discutio la caracterizacion de la prohibicion polaca de voluntades conjuntas y encontro que la voluntad conjunta de un ciudadano polaco que habia estado viviendo en Alemania es valida bajo la ley alemana aplicable. EnglishThe European Succession Regulation (Regulation (EU) No 650/2012) entered into force on 16 August 2012 and applies since 17 August 2015. To facilitate the application of the Regulation, the German legislator introduced a “Law on International Succession Law and the Amendment of Provisions on Certificates of Inheritance and other areas”. One aspect of the new German law is the amendment of Article 25 of the Introductory Act to the German Civil Code (EGBGB) which now provides that chapter III of the Succession Regulation shall also apply to successions that do not fall within the Regulation’s Scope of application. In its decision, the Schleswig Higher Regional Court found that Article 25 EGBGB only extends the material but not the Temporal Scope of the Regulation. Furthermore, it discussed the characterization of the Polish prohibition of joint wills and found that the joint will of a Polish cit
C.l. Nehaniv - One of the best experts on this subject based on the ideXlab platform.
-
Sensorimotor experience and its metrics: informational geometry and the Temporal horizon
2005 IEEE Congress on Evolutionary Computation, 2005Co-Authors: C.l. NehanivAbstract:We introduce metrics on sensorimotor experience at various Temporal scales based on information-theory. Sensorimotor variables through which the experience of an agent flows are modeled as information sources in the sense of Shannon information theory. Information distance between the constellation of an embodied agent's sensorimotor variables at different moments in time can be taken variable-by-variable or between entire sets of such variables to yield two classes of metrics on sensorimotor experience: the Temporal experiential information distance and the Hausdorff metric on experience. Unlike mutual information, these measures each satisfy the metric axioms and thus induce a geometry on the space of experiences with the same Temporal Scope. Continuity of maps between experiential spaces as well as robotic applications and extensions are discussed
Lei Ju - One of the best experts on this subject based on the ideXlab platform.
-
Scope-Aware Useful Cache Block Analysis for Data Cache Related Preemption Delay
2017 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2017Co-Authors: Wei Zhang, Fan Gong, Lei Ju, Nan GuanAbstract:Static timing analysis is crucial for design of realtime systems. While the worst-case execution time of a task is typically computed or measured in a single task environment, the presence of caches imposes additional cache related preemption delay (CRPD) cost to the lower priority tasks in a preemptive multi-tasking system. In this work, we show that existing instruction CRPD analysis techniques cannot be straightforwardly extended for safe and precise data CRPD analysis. In order to capture the dynamic behavior of the data memory references, we introduce the notion of Temporal Scopes into the abstract cache state (ACS) to capture the data memory blocks that must or may reside in the cache during certain time intervals of program execution. Based on the improved ACS representation, we present a Temporal Scope aware useful cache block (UCB) calculation for safe and tight estimation of the data CRPD cost. Experimental results show that the proposed technique leads to substantially tighter CRPD estimation, and is applicable to programs with complex data reference patterns.
-
RTAS - Scope-Aware Useful Cache Block Analysis for Data Cache Related Preemption Delay
2017 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2017Co-Authors: Wei Zhang, Fan Gong, Lei Ju, Nan GuanAbstract:Static timing analysis is crucial for design of realtime systems. While the worst-case execution time of a task is typically computed or measured in a single task environment, the presence of caches imposes additional cache related preemption delay (CRPD) cost to the lower priority tasks in a preemptive multi-tasking system. In this work, we show that existing instruction CRPD analysis techniques cannot be straightforwardly extended for safe and precise data CRPD analysis. In order to capture the dynamic behavior of the data memory references, we introduce the notion of Temporal Scopes into the abstract cache state (ACS) to capture the data memory blocks that must or may reside in the cache during certain time intervals of program execution. Based on the improved ACS representation, we present a Temporal Scope aware useful cache block (UCB) calculation for safe and tight estimation of the data CRPD cost. Experimental results show that the proposed technique leads to substantially tighter CRPD estimation, and is applicable to programs with complex data reference patterns.
