Sciweavers

PPOPP
2012
ACM
12 years 16 days ago
Concurrent breakpoints
In program debugging, reproducibility of bugs is a key requirement. Unfortunately, bugs in concurrent programs are notoriously difficult to reproduce because bugs due to concurre...
Chang-Seo Park, Koushik Sen
ASPLOS
2012
ACM
12 years 21 days ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...
ASPLOS
2011
ACM
12 years 8 months ago
Hybrid NOrec: a case study in the effectiveness of best effort hardware transactional memory
Transactional memory (TM) is a promising synchronization mechanism for the next generation of multicore processors. Best-effort Hardware Transactional Memory (HTM) designs, such a...
Luke Dalessandro, François Carouge, Sean Wh...
TVLSI
2008
112views more  TVLSI 2008»
13 years 4 months ago
System Architecture and Implementation of MIMO Sphere Decoders on FPGA
Multiple-input
Xin-Ming Huang, Cao Liang, Jing Ma
TCS
2008
13 years 4 months ago
A timed semantics of Orc
Orc is a kernel language for structured concurrent programming. Orc provides three powerful combinators that define the structure of a concurrent computation. These combinators su...
Ian Wehrman, David Kitchin, William R. Cook, Jayad...
ENTCS
2008
122views more  ENTCS 2008»
13 years 5 months ago
Concurrency in Biological Modeling: Behavior, Execution and Visualization
Modeling natural systems is a complicated task that involves the concurrent behavior of various processes, mechanisms and objects. Here, we describe an approach that we have been ...
David Harel, Yaki Setty, Sol Efroni, Naamah Swerdl...
HIPEAC
2010
Springer
13 years 7 months ago
Improving Performance by Reducing Aborts in Hardware Transactional Memory
The optimistic nature of Transactional Memory (TM) systems can lead to the concurrent execution of transactions that are later found to conflict. Conflicts degrade scalability, a...
Mohammad Ansari, Behram Khan, Mikel Luján, ...
HIPEAC
2009
Springer
13 years 9 months ago
Steal-on-Abort: Improving Transactional Memory Performance through Dynamic Transaction Reordering
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
Mohammad Ansari, Mikel Luján, Christos Kots...
CCGRID
2007
IEEE
13 years 11 months ago
A Simulation Study of Data Partitioning Algorithms for Multiple Clusters
Abstract— Recently we proposed algorithms for concurrent execution on multiple clusters [9]. In this case, data partitioning is done at two levels; first, the data is distribute...
Chen Yu, Dan C. Marinescu, Howard Jay Siegel, John...