Sciweavers

147 search results - page 12 / 30
» Development routes for message passing parallelism in Java
Sort
View
MA
1999
Springer
155views Communications» more  MA 1999»
13 years 11 months ago
JGram: Rapid Development of Multi-Agent Pipelines for Real-World Tasks
Many real-world tasks can be decomposed into pipelines of sequential operations (where subtasks may themselves be composed of one or more pipelines). JGram is a framework enabling...
Rahul Sukthankar, Antoine Brusseau, Ray Pelletier,...
ICPP
1998
IEEE
13 years 11 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
IPPS
2005
IEEE
14 years 1 months ago
Message Scheduling for All-to-All Personalized Communication on Ethernet Switched Clusters
We develop a message scheduling scheme that can theoretically achieve the maximum throughput for all–to–all personalized communication (AAPC) on any given Ethernet switched cl...
Ahmad Faraj, Xin Yuan
EUROMICRO
1996
IEEE
13 years 11 months ago
Efficient Program Composition on Parix by the Ensemble Methodology
A message passing program composition methodology, called Ensemble, applied for Parix is presented. Ensemble overcomes the implementation problems and complexities in developing a...
John Yiannis Cotronis
IPPS
1998
IEEE
13 years 11 months ago
A Case for Aggregate Networks
Parallel processing networks, even full crossbars, that only implement point-to-point and multicast message passing are inefficient for collective communications because multiple ...
Raymond Hoare, Henry G. Dietz