The Experts below are selected from a list of 261 Experts worldwide ranked by ideXlab platform
Milind Kulkarni - One of the best experts on this subject based on the ideXlab platform.
-
legato end to end Bounded Region serializability using commodity hardware transactional memory
Symposium on Code Generation and Optimization, 2017Co-Authors: Aritra Sengupta, Man Cao, Michael D Bond, Milind KulkarniAbstract:Shared-memory languages and systems provide strong guarantees only for well-synchronized (data-race-free) programs. Prior work introduces support for memory consistency based on Region serializability of executing code Regions, but all approaches incur serious limitations such as adding high run-time overhead or relying on complex custom hardware. This paper explores the potential for leveraging widely available, commodity hardware transactional memory to provide an end-to-end memory consistency model called dynamically Bounded Region serializability (DBRS). To amortize high per-transaction costs, yet mitigate the risk of unpredictable, costly aborts, we introduce dynamic runtime support called Legato that executes multiple dynamically Bounded Regions (DBRs) in a single transaction. Legato varies the number of DBRs per transaction on the fly, based on the recent history of committed and aborted transactions. Legato outperforms existing commodity enforcement of DBRS, and its costs are less sensitive to a program's shared-memory communication patterns. These results demonstrate the potential for providing always-on strong memory consistency using commodity transactional hardware.
-
CGO - Legato: end-to-end Bounded Region serializability using commodity hardware transactional memory
2017 IEEE ACM International Symposium on Code Generation and Optimization (CGO), 2017Co-Authors: Aritra Sengupta, Man Cao, Michael D Bond, Milind KulkarniAbstract:Shared-memory languages and systems provide strong guarantees only for well-synchronized (data-race-free) programs. Prior work introduces support for memory consistency based on Region serializability of executing code Regions, but all approaches incur serious limitations such as adding high run-time overhead or relying on complex custom hardware. This paper explores the potential for leveraging widely available, commodity hardware transactional memory to provide an end-to-end memory consistency model called dynamically Bounded Region serializability (DBRS). To amortize high per-transaction costs, yet mitigate the risk of unpredictable, costly aborts, we introduce dynamic runtime support called Legato that executes multiple dynamically Bounded Regions (DBRs) in a single transaction. Legato varies the number of DBRs per transaction on the fly, based on the recent history of committed and aborted transactions. Legato outperforms existing commodity enforcement of DBRS, and its costs are less sensitive to a program's shared-memory communication patterns. These results demonstrate the potential for providing always-on strong memory consistency using commodity transactional hardware.
-
hybrid static dynamic analysis for statically Bounded Region serializability
Architectural Support for Programming Languages and Operating Systems, 2015Co-Authors: Aritra Sengupta, Michael D Bond, Swarnendu Biswas, Minjia Zhang, Milind KulkarniAbstract:Data races are common. They are difficult to detect, avoid, or eliminate, and programmers sometimes introduce them intentionally. However, shared-memory programs with data races have unexpected, erroneous behaviors. Intentional and unintentional data races lead to atomicity and sequential consistency (SC) violations, and they make it more difficult to understand, test, and verify software. Existing approaches for providing stronger guarantees for racy executions add high run-time overhead and/or rely on custom hardware. This paper shows how to provide stronger semantics for racy programs while providing relatively good performance on commodity systems. A novel hybrid static--dynamic analysis called \emph{EnfoRSer} provides end-to-end support for a memory model called \emph{statically Bounded Region serializability} (SBRS) that is not only stronger than weak memory models but is strictly stronger than SC. EnfoRSer uses static compiler analysis to transform Regions, and dynamic analysis to detect and resolve conflicts at run time. By demonstrating commodity support for a reasonably strong memory model with reasonable overheads, we show its potential as an always-on execution model.
-
ASPLOS - Hybrid Static–Dynamic Analysis for Statically Bounded Region Serializability
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015Co-Authors: Aritra Sengupta, Michael D Bond, Swarnendu Biswas, Minjia Zhang, Milind KulkarniAbstract:Data races are common. They are difficult to detect, avoid, or eliminate, and programmers sometimes introduce them intentionally. However, shared-memory programs with data races have unexpected, erroneous behaviors. Intentional and unintentional data races lead to atomicity and sequential consistency (SC) violations, and they make it more difficult to understand, test, and verify software. Existing approaches for providing stronger guarantees for racy executions add high run-time overhead and/or rely on custom hardware. This paper shows how to provide stronger semantics for racy programs while providing relatively good performance on commodity systems. A novel hybrid static--dynamic analysis called \emph{EnfoRSer} provides end-to-end support for a memory model called \emph{statically Bounded Region serializability} (SBRS) that is not only stronger than weak memory models but is strictly stronger than SC. EnfoRSer uses static compiler analysis to transform Regions, and dynamic analysis to detect and resolve conflicts at run time. By demonstrating commodity support for a reasonably strong memory model with reasonable overheads, we show its potential as an always-on execution model.
Aritra Sengupta - One of the best experts on this subject based on the ideXlab platform.
-
legato end to end Bounded Region serializability using commodity hardware transactional memory
Symposium on Code Generation and Optimization, 2017Co-Authors: Aritra Sengupta, Man Cao, Michael D Bond, Milind KulkarniAbstract:Shared-memory languages and systems provide strong guarantees only for well-synchronized (data-race-free) programs. Prior work introduces support for memory consistency based on Region serializability of executing code Regions, but all approaches incur serious limitations such as adding high run-time overhead or relying on complex custom hardware. This paper explores the potential for leveraging widely available, commodity hardware transactional memory to provide an end-to-end memory consistency model called dynamically Bounded Region serializability (DBRS). To amortize high per-transaction costs, yet mitigate the risk of unpredictable, costly aborts, we introduce dynamic runtime support called Legato that executes multiple dynamically Bounded Regions (DBRs) in a single transaction. Legato varies the number of DBRs per transaction on the fly, based on the recent history of committed and aborted transactions. Legato outperforms existing commodity enforcement of DBRS, and its costs are less sensitive to a program's shared-memory communication patterns. These results demonstrate the potential for providing always-on strong memory consistency using commodity transactional hardware.
-
CGO - Legato: end-to-end Bounded Region serializability using commodity hardware transactional memory
2017 IEEE ACM International Symposium on Code Generation and Optimization (CGO), 2017Co-Authors: Aritra Sengupta, Man Cao, Michael D Bond, Milind KulkarniAbstract:Shared-memory languages and systems provide strong guarantees only for well-synchronized (data-race-free) programs. Prior work introduces support for memory consistency based on Region serializability of executing code Regions, but all approaches incur serious limitations such as adding high run-time overhead or relying on complex custom hardware. This paper explores the potential for leveraging widely available, commodity hardware transactional memory to provide an end-to-end memory consistency model called dynamically Bounded Region serializability (DBRS). To amortize high per-transaction costs, yet mitigate the risk of unpredictable, costly aborts, we introduce dynamic runtime support called Legato that executes multiple dynamically Bounded Regions (DBRs) in a single transaction. Legato varies the number of DBRs per transaction on the fly, based on the recent history of committed and aborted transactions. Legato outperforms existing commodity enforcement of DBRS, and its costs are less sensitive to a program's shared-memory communication patterns. These results demonstrate the potential for providing always-on strong memory consistency using commodity transactional hardware.
-
hybrid static dynamic analysis for statically Bounded Region serializability
Architectural Support for Programming Languages and Operating Systems, 2015Co-Authors: Aritra Sengupta, Michael D Bond, Swarnendu Biswas, Minjia Zhang, Milind KulkarniAbstract:Data races are common. They are difficult to detect, avoid, or eliminate, and programmers sometimes introduce them intentionally. However, shared-memory programs with data races have unexpected, erroneous behaviors. Intentional and unintentional data races lead to atomicity and sequential consistency (SC) violations, and they make it more difficult to understand, test, and verify software. Existing approaches for providing stronger guarantees for racy executions add high run-time overhead and/or rely on custom hardware. This paper shows how to provide stronger semantics for racy programs while providing relatively good performance on commodity systems. A novel hybrid static--dynamic analysis called \emph{EnfoRSer} provides end-to-end support for a memory model called \emph{statically Bounded Region serializability} (SBRS) that is not only stronger than weak memory models but is strictly stronger than SC. EnfoRSer uses static compiler analysis to transform Regions, and dynamic analysis to detect and resolve conflicts at run time. By demonstrating commodity support for a reasonably strong memory model with reasonable overheads, we show its potential as an always-on execution model.
-
ASPLOS - Hybrid Static–Dynamic Analysis for Statically Bounded Region Serializability
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015Co-Authors: Aritra Sengupta, Michael D Bond, Swarnendu Biswas, Minjia Zhang, Milind KulkarniAbstract:Data races are common. They are difficult to detect, avoid, or eliminate, and programmers sometimes introduce them intentionally. However, shared-memory programs with data races have unexpected, erroneous behaviors. Intentional and unintentional data races lead to atomicity and sequential consistency (SC) violations, and they make it more difficult to understand, test, and verify software. Existing approaches for providing stronger guarantees for racy executions add high run-time overhead and/or rely on custom hardware. This paper shows how to provide stronger semantics for racy programs while providing relatively good performance on commodity systems. A novel hybrid static--dynamic analysis called \emph{EnfoRSer} provides end-to-end support for a memory model called \emph{statically Bounded Region serializability} (SBRS) that is not only stronger than weak memory models but is strictly stronger than SC. EnfoRSer uses static compiler analysis to transform Regions, and dynamic analysis to detect and resolve conflicts at run time. By demonstrating commodity support for a reasonably strong memory model with reasonable overheads, we show its potential as an always-on execution model.
Michael D Bond - One of the best experts on this subject based on the ideXlab platform.
-
legato end to end Bounded Region serializability using commodity hardware transactional memory
Symposium on Code Generation and Optimization, 2017Co-Authors: Aritra Sengupta, Man Cao, Michael D Bond, Milind KulkarniAbstract:Shared-memory languages and systems provide strong guarantees only for well-synchronized (data-race-free) programs. Prior work introduces support for memory consistency based on Region serializability of executing code Regions, but all approaches incur serious limitations such as adding high run-time overhead or relying on complex custom hardware. This paper explores the potential for leveraging widely available, commodity hardware transactional memory to provide an end-to-end memory consistency model called dynamically Bounded Region serializability (DBRS). To amortize high per-transaction costs, yet mitigate the risk of unpredictable, costly aborts, we introduce dynamic runtime support called Legato that executes multiple dynamically Bounded Regions (DBRs) in a single transaction. Legato varies the number of DBRs per transaction on the fly, based on the recent history of committed and aborted transactions. Legato outperforms existing commodity enforcement of DBRS, and its costs are less sensitive to a program's shared-memory communication patterns. These results demonstrate the potential for providing always-on strong memory consistency using commodity transactional hardware.
-
CGO - Legato: end-to-end Bounded Region serializability using commodity hardware transactional memory
2017 IEEE ACM International Symposium on Code Generation and Optimization (CGO), 2017Co-Authors: Aritra Sengupta, Man Cao, Michael D Bond, Milind KulkarniAbstract:Shared-memory languages and systems provide strong guarantees only for well-synchronized (data-race-free) programs. Prior work introduces support for memory consistency based on Region serializability of executing code Regions, but all approaches incur serious limitations such as adding high run-time overhead or relying on complex custom hardware. This paper explores the potential for leveraging widely available, commodity hardware transactional memory to provide an end-to-end memory consistency model called dynamically Bounded Region serializability (DBRS). To amortize high per-transaction costs, yet mitigate the risk of unpredictable, costly aborts, we introduce dynamic runtime support called Legato that executes multiple dynamically Bounded Regions (DBRs) in a single transaction. Legato varies the number of DBRs per transaction on the fly, based on the recent history of committed and aborted transactions. Legato outperforms existing commodity enforcement of DBRS, and its costs are less sensitive to a program's shared-memory communication patterns. These results demonstrate the potential for providing always-on strong memory consistency using commodity transactional hardware.
-
hybrid static dynamic analysis for statically Bounded Region serializability
Architectural Support for Programming Languages and Operating Systems, 2015Co-Authors: Aritra Sengupta, Michael D Bond, Swarnendu Biswas, Minjia Zhang, Milind KulkarniAbstract:Data races are common. They are difficult to detect, avoid, or eliminate, and programmers sometimes introduce them intentionally. However, shared-memory programs with data races have unexpected, erroneous behaviors. Intentional and unintentional data races lead to atomicity and sequential consistency (SC) violations, and they make it more difficult to understand, test, and verify software. Existing approaches for providing stronger guarantees for racy executions add high run-time overhead and/or rely on custom hardware. This paper shows how to provide stronger semantics for racy programs while providing relatively good performance on commodity systems. A novel hybrid static--dynamic analysis called \emph{EnfoRSer} provides end-to-end support for a memory model called \emph{statically Bounded Region serializability} (SBRS) that is not only stronger than weak memory models but is strictly stronger than SC. EnfoRSer uses static compiler analysis to transform Regions, and dynamic analysis to detect and resolve conflicts at run time. By demonstrating commodity support for a reasonably strong memory model with reasonable overheads, we show its potential as an always-on execution model.
-
ASPLOS - Hybrid Static–Dynamic Analysis for Statically Bounded Region Serializability
Proceedings of the Twentieth International Conference on Architectural Support for Programming Languages and Operating Systems, 2015Co-Authors: Aritra Sengupta, Michael D Bond, Swarnendu Biswas, Minjia Zhang, Milind KulkarniAbstract:Data races are common. They are difficult to detect, avoid, or eliminate, and programmers sometimes introduce them intentionally. However, shared-memory programs with data races have unexpected, erroneous behaviors. Intentional and unintentional data races lead to atomicity and sequential consistency (SC) violations, and they make it more difficult to understand, test, and verify software. Existing approaches for providing stronger guarantees for racy executions add high run-time overhead and/or rely on custom hardware. This paper shows how to provide stronger semantics for racy programs while providing relatively good performance on commodity systems. A novel hybrid static--dynamic analysis called \emph{EnfoRSer} provides end-to-end support for a memory model called \emph{statically Bounded Region serializability} (SBRS) that is not only stronger than weak memory models but is strictly stronger than SC. EnfoRSer uses static compiler analysis to transform Regions, and dynamic analysis to detect and resolve conflicts at run time. By demonstrating commodity support for a reasonably strong memory model with reasonable overheads, we show its potential as an always-on execution model.
Jorge Zanelli - One of the best experts on this subject based on the ideXlab platform.
-
Theta term in a Bounded Region
Physical Review D, 2011Co-Authors: Fabrizio Canfora, Luigi Rosa, Jorge ZanelliAbstract:We analyse the physical implications of adding a topological density term $\theta Tr(F\wedge F)$ to a gauge theory in a Bounded Region. In particular, we calculate the Casimir effect on a spherical Region and we show that the result is not periodic in $\theta$, contrary to what would be expected for a true topological density. The topological nature of the $\theta$-term can be restored if an additional boundary term required by the Atiyah-Patodi-Singer theorem is included. Then, the periodicity is trivially restored because the resulting Casimir energy is independent of $\theta$. The results of the present work suggest that the observable effects of the $\theta$-term could be very small even without assuming $\theta$ itself to be small.Comment: 15 pages, no figures. Minor changes, added references. To appear in Phys. Rev.
-
theta term in a Bounded Region
Physical Review D, 2011Co-Authors: Fabrizio Canfora, Luigi Rosa, Jorge ZanelliAbstract:We analyse the physical implications of adding a topological density term θTr(F ∧F) to a gauge theory in a Bounded Region. In particular, we calculate the Casimir effect on a spherical Region and we show that the result is not periodic in θ, contrary to what would be expected for a true topological density. The topological nature of the θ-term can be restored if an additional boundary term required by the Atiyah-PatodiSinger theorem is included. Then, the periodicity is trivially restored because the resulting Casimir energy is independent of θ. The results of the present work suggest that the observable effects of the θ term could be very small even without assuming θ itself to be small. e-mails: canfora-at-cecs.cl rosa-at-na.infn.it z-at-cecs.cl
Ness B. Shroff - One of the best experts on this subject based on the ideXlab platform.
-
first exit time of a levy flight from a Bounded Region in rn
Journal of Applied Probability, 2015Co-Authors: Yoora Kim, Irem Koprulu, Ness B. ShroffAbstract:In this paper, we characterize the mean and the distribution of the first exit time of a Levy flight from a Bounded Region in N-dimensional spaces. We characterize tight upper and lower bounds on the tail distribution of the first exit time, and provide the exact asymptotics of the mean first exit time for a given range of step-length distribution parameters.
-
First exit time of a Lévy flight from a Bounded Region in ℝN
Journal of Applied Probability, 2015Co-Authors: Yoora Kim, Irem Koprulu, Ness B. ShroffAbstract:In this paper we characterize the mean and the distribution of the first exit time of a Lévy flight from a Bounded Region in N-dimensional spaces. We characterize tight upper and lower bounds on the tail distribution of the first exit time, and provide the exact asymptotics of the mean first exit time for a given range of step-length distribution parameters.
-
First exit time of a Lévy flight from a Bounded Region in RN
Journal of Applied Probability, 2015Co-Authors: Yoora Kim, Irem Koprulu, Ness B. ShroffAbstract:In this paper we characterize the mean and the distribution of the first exit time of a Lévy flight from a Bounded Region inN-dimensional spaces. We characterize tight upper and lower bounds on the tail distribution of the first exit time, and provide the exact asymptotics of the mean first exit time for a given range of step-length distribution parameters.