2497 search results - page 165 / 500 » Requirements for models of achievable routing |
CLUSTER
2006
IEEE
15 years 8 months ago
2006
IEEE
The RandomAccess benchmark as defined by the High Performance Computing Challenge (HPCC) tests the speed at which a machine can update the elements of a table spread across globa...
106
click to vote
CCGRID
2005
IEEE
15 years 7 months ago
2005
IEEE
— The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates management...
119
click to vote
COMPSAC
2002
IEEE
15 years 7 months ago
2002
IEEE
Universal access to information and data is an important goal of current research. Previously different forms of information and data, captured by different devices or held on dif...
117
click to vote
MICRO
2002
IEEE
15 years 6 months ago
2002
IEEE
In a 64-bit processor, many of the data values actually used in computations require much narrower data-widths. In this study, we demonstrate that instruction data-widths exhibit ...
108
click to vote
SIGCOMM
1997
ACM
15 years 6 months ago
1997
ACM
Datagram services provide a simple,
exible, robust, and communication abstraction; their usefulness has been well demonstrated by the success of IP, UDP, and RPC. Yet, the overwh...