Sciweavers

1136 search results - page 133 / 228
» Finding Small Holes
Sort
View
LCPC
1997
Springer
14 years 29 days ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
EUROSYS
2010
ACM
14 years 28 days ago
Locating cache performance bottlenecks using data profiling
Effective use of CPU data caches is critical to good performance, but poor cache use patterns are often hard to spot using existing execution profiling tools. Typical profilers at...
Aleksey Pesterev, Nickolai Zeldovich, Robert T. Mo...
CHI
1994
ACM
14 years 28 days ago
User preferences for task-specific vs. generic application software
We conducted an ethnographic study to investigate the use of generic vs. task-specific application software by people who create and maintain presentation slides. Sixteen people w...
Bonnie A. Nardi, Jeff A. Johnson
ASPDAC
2007
ACM
136views Hardware» more  ASPDAC 2007»
14 years 25 days ago
A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
- In routing, finding a rectilinear Steiner minimal tree (RSMT) is a fundamental problem. Today's design often contains rectilinear obstacles, like macro cells, IP blocks, and...
Pei-Ci Wu, Jhih-Rong Gao, Ting-Chi Wang
CONEXT
2007
ACM
14 years 23 days ago
Router buffer sizing revisited: the role of the output/input capacity ratio
The issue of router buffer sizing is still open and significant. Previous work either considers open-loop traffic or only analyzes persistent TCP flows. This paper differs in two ...
Ravi S. Prasad, Constantine Dovrolis, Marina Thott...