Sciweavers

352 search results - page 26 / 71
» Good Programming in Transactional Memory
Sort
View
DAWAK
2008
Springer
15 years 5 months ago
Efficient Approximate Mining of Frequent Patterns over Transactional Data Streams
Abstract. We investigate the problem of finding frequent patterns in a continuous stream of transactions. It is recognized that the approximate solutions are usually sufficient and...
Willie Ng, Manoranjan Dash
ICFP
2008
ACM
16 years 3 months ago
Transactional events for ML
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
Laura Effinger-Dean, Matthew Kehrt, Dan Grossman
116
Voted
POPL
1994
ACM
15 years 7 months ago
Memory Subsystem Performance of Programs Using Copying Garbage Collection
Heap allocation with copying garbage collection is believed to have poormemory subsystem performance. We conducted a studyofthememory subsystem performance of heap allocation for ...
Amer Diwan, David Tarditi, J. Eliot B. Moss
ASPDAC
2006
ACM
109views Hardware» more  ASPDAC 2006»
15 years 6 months ago
Hardware debugging method based on signal transitions and transactions
- This paper proposes a hardware design debugging method, Transition and Transaction Tracer (TTT), which probes and records the signals of interest for a long time, hours, days, or...
Nobuyuki Ohba, Kohji Takano
MICRO
2010
IEEE
153views Hardware» more  MICRO 2010»
15 years 1 months ago
Scalable Speculative Parallelization on Commodity Clusters
While clusters of commodity servers and switches are the most popular form of large-scale parallel computers, many programs are not easily parallelized for execution upon them. In...
Hanjun Kim, Arun Raman, Feng Liu, Jae W. Lee, Davi...