Sciweavers

323 search results - page 9 / 65
» A Comparison of MPI and Process Networks
Sort
View
QEST
2009
IEEE
14 years 2 months ago
Comparison of Two Output Models for the BMAP/MAP/1 Departure Process
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
Qi Zhang, Armin Heindl, Evgenia Smirni, Andreas St...
CLUSTER
2004
IEEE
13 years 11 months ago
A comparison of local and gang scheduling on a Beowulf cluster
Gang Scheduling and related techniques are widely believed to be necessary for efficientjob scheduling on distributed memory parallel computers. This is hecause they minimize cont...
Peter E. Strazdins, John Uhlmann
SNPD
2003
13 years 9 months ago
Incomplete Information Processing for Optimization of Distributed Applications
This paper focuses on non-strict processing, optimization, and partial evaluation of MPI programs which use incremental data structures (ISs). We describe the design and implement...
Alfredo Cristóbal-Salas, Andrei Tchernykh, ...
GIS
2003
ACM
14 years 8 months ago
Processing in-route nearest neighbor queries: a comparison of alternative approaches
Nearest neighbor query is one of the most important operations in spatial databases and their application domains, e.g., locationbased services, advanced traveler information syst...
Shashi Shekhar, Jin Soung Yoo
IJCNN
2006
IEEE
14 years 1 months ago
A Comparison between Recursive Neural Networks and Graph Neural Networks
— Recursive Neural Networks (RNNs) and Graph Neural Networks (GNNs) are two connectionist models that can directly process graphs. RNNs and GNNs exploit a similar processing fram...
Vincenzo Di Massa, Gabriele Monfardini, Lorenzo Sa...