Sciweavers

354 search results - page 41 / 71
» Sorting networks on FPGAs
Sort
View
IPPS
1998
IEEE
14 years 3 months ago
An Efficient Counting Network
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...
Costas Busch, Marios Mavronicolas
MST
1998
75views more  MST 1998»
13 years 10 months ago
Periodic Merging Networks
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â...
Miroslaw Kutylowski, Krzysztof Lorys, Brigitte Oes...
ANCS
2011
ACM
12 years 11 months ago
ReClick - A Modular Dataplane Design Framework for FPGA-Based Network Virtualization
Network virtualization has emerged as a powerful technique to deploy novel services and experimental protocols over shared network infrastructures. Although recent research has hi...
Deepak Unnikrishnan, Justin Lu, Lixin Gao, Russell...
SIGCOMM
1994
ACM
14 years 3 months ago
Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers
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...
Charles E. Perkins, Pravin Bhagwat
SC
2000
ACM
14 years 3 months ago
Distributed Rendering for Scalable Displays
We describe a novel distributed graphics system that allows an application to render to a large tiled display. Our system, called WireGL, uses a cluster of off-the-shelf PCs conne...
Greg Humphreys, Ian Buck, Matthew Eldridge, Pat Ha...