2703 search results - page 370 / 541 » Optimizing memory transactions |
174
Voted
SPAA
1996
ACM
15 years 7 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
135
Voted
IOPADS
1996
15 years 5 months ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
176
Voted
FPGA
2010
ACM
15 years 3 months ago
2010
ACM
We use reconfigurable hardware to construct a high throughput Bayesian computing machine (BCM) capable of evaluating probabilistic networks with arbitrary DAG (directed acyclic gr...
134
Voted
SIGMETRICS
2008
ACM
15 years 3 months ago
2008
ACM
Enterprise customers are increasingly adopting MPLS (Multiprotocol Label Switching) VPN (Virtual Private Network) service that offers direct any-to-any reachability among the cust...
145
click to vote
ISPDC
2010
IEEE
15 years 2 months ago
2010
IEEE
—Super-scalar, out-of-order processors that can have tens of read and write requests in the execution window place significant demands on Memory Level Parallelism (MLP). Multi- ...