332 search results - page 43 / 67 » Hypercubic Sorting Networks |
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Network processors today consists of multiple parallel processors (microengines) with support for multiple threads to exploit packet level parallelism inherent in network workload...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar t...
MST
1998
13 years 7 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...
JSA
2000
13 years 7 months ago
2000
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
SIGCOMM
1994
ACM
13 years 11 months ago
1994
ACM
An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an inno...