Sciweavers

437 search results - page 19 / 88
» Reducing Memory Sharing Overheads in Distributed JVMs
Sort
View
IPPS
2006
IEEE
14 years 1 months ago
Tree partition based parallel frequent pattern mining on shared memory systems
In this paper, we present a tree-partition algorithm for parallel mining of frequent patterns. Our work is based on FP-Growth algorithm, which is constituted of tree-building stag...
Dehao Chen, Chunrong Lai, Wei Hu, Wenguang Chen, Y...
ICS
2009
Tsinghua U.
14 years 3 days ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
SPAA
2012
ACM
11 years 10 months ago
Memory-mapping support for reducer hyperobjects
hyperobjects (reducers) provide a linguistic abstraction for dynamic multithreading that allows different branches of a parallel program to maintain coordinated local views of the...
I.-Ting Angelina Lee, Aamir Shafi, Charles E. Leis...
CCGRID
2001
IEEE
13 years 11 months ago
Adaptive Prefetching Technique for Shared Virtual Memory
Though shared virtual memory (SVM) systems promise low cost solutions for high performance computing, they suffer from long memory latencies. These latencies are usually caused by...
Sang-Kwon Lee, Hee-Chul Yun, Joonwon Lee, Seungryo...
ISPAN
1999
IEEE
13 years 11 months ago
A Java Internet Computing Environment with Effective Configuration Method
For an effective Internet-based distributed parallel computing platform, Java-Internet Computing Environment (JICE) is designed and implemented with multithreading and remote meth...
Chun-Mok Chung, Pil-Sup Shin, Shin-Dug Kim