Sciweavers

7225 search results - page 344 / 1445
» On the Computational Power of Biochemistry
Sort
View
PPOPP
2009
ACM
16 years 7 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
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 7 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...
CCGRID
2007
IEEE
16 years 1 months ago
Performance Evaluation in Grid Computing: A Modeling and Prediction Perspective
Experimental performance studies on computer systems, including Grids, require deep understandings on their workload characteristics. The need arises from two important and closel...
Hui Li
CGO
2005
IEEE
16 years 12 days ago
Effective Adaptive Computing Environment Management via Dynamic Optimization
To minimize the surging power consumption of microprocessors, adaptive computing environments (ACEs) where microarchitectural resources can be dynamically tuned to match a program...
Shiwen Hu, Madhavi Gopal Valluri, Lizy Kurian John
ICPADS
2005
IEEE
16 years 12 days ago
I/O Processor Allocation for Mesh Cluster Computers
As cluster systems become increasingly popular, more and more parallel applications require need not only computing power but also significant I/O performance. However, the I/O s...
Pangfeng Liu, Chun-Chen Hsu, Jan-Jan Wu