Sciweavers

2473 search results - page 24 / 495
» The Logic of Communication Graphs
Sort
View
ICCS
2009
Springer
14 years 2 months ago
Hiding Communication Latency with Non-SPMD, Graph-Based Execution
Reformulating an algorithm to mask communication delays is crucial in maintaining scalability, but traditional solutions embed the overlap strategy into the application. We present...
Jacob Sorensen, Scott B. Baden
IPPS
1998
IEEE
13 years 12 months ago
A Performance Evaluation of CP List Scheduling Heuristics for Communication Intensive Task Graphs
List-based priority schedulers have long been one of the dominant classes of static scheduling algorithms. Such heuristics have been predominantly based around the "critical ...
Benjamin S. Macey, Albert Y. Zomaya
PC
2000
96views Management» more  PC 2000»
13 years 7 months ago
Multicast communication in wormhole-routed star graph interconnection networks
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...
Tzung-Shi Chen, Neng-Chung Wang, Chih-Ping Chu
ICCS
2007
Springer
14 years 1 months ago
Learning Common Outcomes of Communicative Actions Represented by Labeled Graphs
We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in te...
Boris Galitsky, Boris Kovalerchuk, Sergei O. Kuzne...
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 7 months ago
Probabilistic regular graphs
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...
Nathalie Bertrand, Christophe Morvan