Sciweavers

620 search results - page 25 / 124
» Optimizing the BSD routing system for parallel processing
Sort
View
HIPC
2003
Springer
14 years 23 days ago
Performance Analysis of Blue Gene/L Using Parallel Discrete Event Simulation
High performance computers currently under construction, such as IBM’s Blue Gene/L, consisting of large numbers (64K) of low cost processing elements with relatively small local...
Ed Upchurch, Paul L. Springer, Maciej Brodowicz, S...
IPPS
1998
IEEE
13 years 11 months ago
Comparing the Optimal Performance of Different MIMD Multiprocessor Architectures
We compare the performance of systems consisting of one large cluster containing q processors with systems where processors are grouped into k clusters containing u processors eac...
Lars Lundberg, Håkan Lennerstad
ICRA
2010
IEEE
128views Robotics» more  ICRA 2010»
13 years 6 months ago
On optimal AUV track-spacing for underwater mine detection
— This work addresses the task of designing the optimal survey route that an autonomous underwater vehicle (AUV) should take in mine countermeasures (MCM) operations. It is assum...
David P. Williams
ISPAN
1997
IEEE
13 years 11 months ago
CASS: an efficient task management system for distributed memory architectures
The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the applica...
Jing-Chiou Liou, Michael A. Palis
ICEIS
2009
IEEE
14 years 2 months ago
Vectorizing Instance-Based Integration Processes
Abstract. The inefficiency of integration processes—as an abstraction of workflow-based integration tasks—is often reasoned by low resource utilization and significant waiti...
Matthias Böhm, Dirk Habich, Steffen Preissler...