3825 search results - page 702 / 765 » More on pooling spaces |
ISCA
2010
IEEE
15 years 2 months ago
2010
IEEE
SIMD organizations amortize the area and power of fetch, decode, and issue logic across multiple processing units in order to maximize throughput for a given area and power budget...
111
click to vote
CF
2010
ACM
15 years 2 months ago
2010
ACM
Supercomputers need a huge budget to be built and maintained. To maximize the usage of their resources, application developers spend time to optimize the code of the parallel appl...
CLOUD
2010
ACM
15 years 2 months ago
2010
ACM
Failures of any type are common in current datacenters, partly due to the higher scales of the data stored. As data scales up, its availability becomes more complex, while differe...
108
click to vote
CSFW
2002
IEEE
15 years 2 months ago
2002
IEEE
We carry forward the work described in our previous papers [3, 14, 12] on the application of data independence to the model checking of cryptographic protocols using CSP [13] and ...
103
click to vote
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
In recent years, gossip-based algorithms have gained prominence as a methodology for designing robust and scalable communication schemes in large distributed systems. The premise ...