Sciweavers

164 search results - page 19 / 33
» The Future Is Parallel But It May Not Be Easy
Sort
View
ICPP
1998
IEEE
15 years 2 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
DATE
2004
IEEE
132views Hardware» more  DATE 2004»
15 years 1 months ago
Hybrid Architectural Dynamic Thermal Management
When an application or external environmental conditions cause a chip's cooling capacity to be exceeded, dynamic thermal management (DTM) dynamically reduces the power densit...
Kevin Skadron
CRYPTO
2011
Springer
195views Cryptology» more  CRYPTO 2011»
13 years 9 months ago
Time-Lock Puzzles in the Random Oracle Model
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
ASPLOS
2009
ACM
15 years 10 months ago
QR decomposition on GPUs
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
Andrew Kerr, Dan Campbell, Mark Richards
HPCA
2003
IEEE
15 years 10 months ago
Tradeoffs in Buffering Memory State for Thread-Level Speculation in Multiprocessors
Thread-level speculation provides architectural support to aggressively run hard-to-analyze code in parallel. As speculative tasks run concurrently, they generate unsafe or specul...
María Jesús Garzarán, Milos P...