Sciweavers

34181 search results - page 433 / 6837
» The Computer System GRAPHOGRAPH
Sort
View
146
Voted
PPOPP
2009
ACM
16 years 4 months ago
An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs
Due to power wall, memory wall, and ILP wall, we are facing the end of ever increasing single-threaded performance. For this reason, multicore and manycore processors are arising ...
Seunghwa Kang, David A. Bader
CHI
2007
ACM
16 years 4 months ago
iStuff mobile: rapidly prototyping new mobile phone interfaces for ubiquitous computing
iStuff Mobile is the first rapid prototyping framework that helps explore new sensor-based interfaces with existing mobile phones. It focuses on sensor-enhanced physical interface...
Rafael Ballagas, Faraz Memon, Rene Reiners, Jan O....
136
Voted
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 4 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
IPPS
2009
IEEE
15 years 10 months ago
DMTCP: Transparent checkpointing for cluster computations and the desktop
DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wid...
Jason Ansel, Kapil Arya, Gene Cooperman
119
Voted
IPPS
2009
IEEE
15 years 10 months ago
High-order stencil computations on multicore clusters
Stencil computation (SC) is of critical importance for broad scientific and engineering applications. However, it is a challenge to optimize complex, highorder SC on emerging clus...
Liu Peng, Richard Seymour, Ken-ichi Nomura, Rajiv ...