6105 search results - page 1209 / 1221 » A Parallel Algorithm for Bound-Smoothing |
ICNP
2003
IEEE
14 years 11 hour ago
2003
IEEE
TCP performs poorly on paths that reorder packets significantly, where it misinterprets out-of-order delivery as packet loss. The sender responds with a fast retransmit though no...
MICRO
2003
IEEE
14 years 1 hour ago
2003
IEEE
Large instruction window processors achieve high performance by exposing large amounts of instruction level parallelism. However, accessing large hardware structures typically req...
SC
2003
ACM
13 years 12 months ago
2003
ACM
The growing processor/memory performance gap causes the performance of many codes to be limited by memory accesses. If known to exist in an application, strided memory accesses fo...
EUROPAR
2003
Springer
13 years 12 months ago
2003
Springer
The advent of high-performance networks in conjunction with low-cost, powerful computational engines has made possible the development of a new set of technologies termed computat...
FIDJI
2003
Springer
13 years 12 months ago
2003
Springer
The popular slogan ”write once, run anywhere” effectively renders the expressive capabilities of the Java programming framework for developing, deploying, and reusing target-i...