1383 search results - page 121 / 277 » Computational Mechanisms for Distributed Requirements Engine... |
135
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
146
click to vote
PSLS
1995
15 years 8 months ago
1995
Abstract. Lazy task creation (LTC) is an e cient approach for executing divide and conquer parallel programs that has been used in the implementation of Multilisp's future con...
154
click to vote
GCC
2007
Springer
15 years 6 months ago
2007
Springer
Executing the legacy program over grid is very important and necessary. To reuse the legacy program, we developed a method based on Component for executing the legacy code. We can...
158
click to vote
NPC
2010
Springer
15 years 3 months ago
2010
Springer
Achieving high performance on today’s architectures requires careful orchestration of many optimization parameters. In particular, the presence of shared-caches on multicore arch...
201
click to vote
CLUSTER
2011
IEEE
14 years 4 months ago
2011
IEEE
— In this paper, we propose a light-weight asynchronous message progression mechanism for large message transfers in Message Passing Interface (MPI) Rendezvous protocol that is s...