2621 search results - page 417 / 525 » Near orders and codes |
175
click to vote
INFOCOM
2007
IEEE
16 years 23 days ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
132
click to vote
IPPS
2007
IEEE
16 years 23 days ago
2007
IEEE
The advent of the Beowulf cluster in 1994 provided dedicated compute cycles, i.e., supercomputing for the masses, as a cost-effective alternative to large supercomputers, i.e., su...
164
click to vote
IPPS
2007
IEEE
16 years 23 days ago
2007
IEEE
This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE prob...
166
click to vote
IPPS
2007
IEEE
16 years 23 days ago
2007
IEEE
With the increasing gap between processor speed and memory latency, the performance of data-dominated programs are becoming more reliant on fast data access, which can be improved...
178
click to vote
ISCAS
2007
IEEE
16 years 22 days ago
2007
IEEE
Abstract—In this paper, we investigate the effect of quantization noise and roundoff errors involved in finite-precision (FP) signal processing on the performance of multiple-in...