Sciweavers

11580 search results - page 2273 / 2316
» Communication vs. Computation
Sort
View
HPCN
1997
Springer
13 years 12 months ago
Parallel Solution of Irregular, Sparse Matrix Problems Using High Performance Fortran
For regular, sparse, linear systems, like those derived from regular grids, using High Performance Fortran (HPF) for iterative solvers is straightforward. However, for irregular ma...
Eric de Sturler, Damian Loher
ISCA
1993
IEEE
112views Hardware» more  ISCA 1993»
13 years 12 months ago
Working Sets, Cache Sizes, and Node Granularity Issues for Large-Scale Multiprocessors
The distribution of resources among processors, memory and caches is a crucial question faced by designers of large-scale parallel machines. If a machine is to solve problems with...
Edward Rothberg, Jaswinder Pal Singh, Anoop Gupta
ASPLOS
1992
ACM
13 years 11 months ago
High Speed Switch Scheduling for Local Area Networks
Current technology trends make it possible to build communication networks that can support high performance distributed computing. This paper describes issues in the design of a ...
Thomas E. Anderson, Susan S. Owicki, James B. Saxe...
ISER
1993
Springer
141views Robotics» more  ISER 1993»
13 years 11 months ago
Experimental Integration of Planning in a Distributed Control System
This paper describes a complete system architecture integrating planning into a two-armed robotic workcell. The system is comprised of four major components: user interface, plann...
Gerardo Pardo-Castellote, Tsai-Yen Li, Yoshihito K...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
« Prev « First page 2273 / 2316 Last » Next »