Sciweavers

5849 search results - page 139 / 1170
» Predictive search distributions
Sort
View
IPPS
2003
IEEE
16 years 6 days ago
Exploring the Predictability of MPI Messages
Scalability to large number of processes is one of the weaknesses of current MPI implementations. Standard implementations are able to scale to hundreds of nodes, but no beyond th...
Felix Freitag, Jordi Caubet, Montse Farreras, Toni...
IPPS
1998
IEEE
15 years 11 months ago
VPPB - A Visualization and Performance Prediction Tool for Multithreaded Solaris Programs
Efficient performance tuning of parallel programs is often hard. In this paper we describe an approach that uses a uni-processor execution of a multithreaded program as reference ...
Magnus Broberg, Lars Lundberg, Håkan Grahn
CLUSTER
2004
IEEE
15 years 10 months ago
Predicting memory-access cost based on data-access patterns
Improving memory performance at software level is more effective in reducing the rapidly expanding gap between processor and memory performance. Loop transformations (e.g. loop un...
Surendra Byna, Xian-He Sun, William Gropp, Rajeev ...
SODA
2003
ACM
127views Algorithms» more  SODA 2003»
15 years 8 months ago
The set-associative cache performance of search trees
We consider the costs of access to data stored in search trees assuming that those memory accesses are managed with a cache. Our cache memory model is two-level, has a small degre...
James D. Fix
ISR
2010
15 years 5 months ago
Electronic Markets, Search Costs, and Firm Boundaries
We study how electronic markets that facilitate broader inter-firm transactions affect the vertical scope of emerging IT-enabled extended enterprises. We do so by modeling firms...
Ramesh Sankaranarayanan, Arun Sundararajan