819 search results - page 63 / 164 » Parallelization with Tree Skeletons |
177
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
144
click to vote
CONCUR
1998
Springer
15 years 10 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
153
click to vote
IPPS
1998
IEEE
15 years 10 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...
157
click to vote
DATE
2008
IEEE
16 years 14 days ago
2008
IEEE
Multi-input addition is an important operation for many DSP and video processing applications. On FPGAs, multi-input addition has traditionally been implemented using trees of car...
151
click to vote
ICPPW
1999
IEEE
15 years 10 months ago
1999
IEEE
As group applications become more prevalent, efficient network utilization becomes a major concern. Multicast transmission may use network bandwidth more efficiently than multiple...