PEAS: A robust energy conserving protocol for long-lived sensor networks
In this paper we present PEAS, a robust energy-conserving protocol that can build long-
lived, resilient sensor networks using a very large number of small sensors with short battery …
lived, resilient sensor networks using a very large number of small sensors with short battery …
Cloud-TM: harnessing the cloud with distributed transactional memories
One of the main challenges to harness the potential of Cloud computing is the design of
programming models that simplify the development of large-scale parallel applications and …
programming models that simplify the development of large-scale parallel applications and …
[HTML][HTML] Stochastic simulated annealing for directed feedback vertex set
The minimum feedback vertex set problem consists in finding the minimum set of vertices
that should be removed in order to make the graph acyclic. This is a well known NP-hard …
that should be removed in order to make the graph acyclic. This is a well known NP-hard …
Aggro: Boosting stm replication via aggressively optimistic transaction processing
Software Transactional Memories (STMs) are emerging as a potentially disruptive
programming model. In this paper we are address the issue of how to enhance …
programming model. In this paper we are address the issue of how to enhance …
Time-communication impossibility results for distributed transactional memory
We consider scheduling problems in the data flow model of distributed transactional
memory. Objects shared by transactions move from one network node to another by …
memory. Objects shared by transactions move from one network node to another by …
Dynamic scheduling in distributed transactional memory
We investigate scheduling algorithms for distributed transactional memory systems where
transactions residing at nodes of a communication graph operate on shared, mobile objects …
transactions residing at nodes of a communication graph operate on shared, mobile objects …
Fast scheduling in distributed transactional memory
We investigate scheduling algorithms for distributed transactional memory systems where
transactions residing at nodes of a communication graph operate on shared, mobile objects …
transactions residing at nodes of a communication graph operate on shared, mobile objects …
Transparent speculative parallelization of discrete event simulation applications using global variables
Parallelizing (compute-intensive) discrete event simulation (DES) applications is a classical
approach for speeding up their execution and for making very large/complex simulation …
approach for speeding up their execution and for making very large/complex simulation …
Transaction scheduling for software transactional memory
M Popovic, B Kordic, I Basicevic - 2017 IEEE 2nd International …, 2017 - ieeexplore.ieee.org
Over the last two decades, researchers developed many Software Transactional Memories
(STMs) with various APIs and semantics. However, reduced performance when exposed to …
(STMs) with various APIs and semantics. However, reduced performance when exposed to …
Hetm: Transactional memory for heterogeneous systems
Modern heterogeneous computing architectures, which couple multi-core CPUs with
discrete many-core GPUs (or other specialized hardware accelerators), enable …
discrete many-core GPUs (or other specialized hardware accelerators), enable …