Sciweavers

6365 search results - page 892 / 1273
» Fast Local Computation Algorithms
Sort
View
HIPC
2005
Springer
16 years 12 days ago
Cooperative Instruction Scheduling with Linear Scan Register Allocation
Abstract. Linear scan register allocation is an attractive register allocation algorithm because of its simplicity and fast running time. However, it is generally felt that linear ...
Khaing Khaing Kyi Win, Weng-Fai Wong
SIGCOMM
2010
ACM
15 years 7 months ago
Improving peer-to-peer file distribution: winner doesn't have to take all
Recent work on BitTorrent has shown that the choke/unchoke mechanism implements an auction where each peer tries to induce other peers into "unchoking" it by uploading m...
Ben Leong, Youming Wang, Su Wen, Cristina Carbunar...
ENTCS
2008
142views more  ENTCS 2008»
15 years 7 months ago
Worst Case Reaction Time Analysis of Concurrent Reactive Programs
Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view t...
Marian Boldt, Claus Traulsen, Reinhard von Hanxled...
CVPR
2000
IEEE
16 years 9 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
ISPDC
2005
IEEE
16 years 14 days ago
GMRES Method on Lightweight GRID System
Grid computing accomplishes high throughput computing by using a very large number of unexploited computing resources. We present a parallel method GMRES to solve large sparse lin...
Haiwu He, Guy Bergére, Serge G. Petiton