Sciweavers

16159 search results - page 2710 / 3232
» Parallel computing with CUDA
Sort
View
STACS
2012
Springer
14 years 2 months ago
Low Randomness Rumor Spreading via Hashing
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
George Giakkoupis, Thomas Sauerwald, He Sun, Phili...

Publication
165views
14 years 13 days ago
Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault
In this paper, we propose a task scheduling algorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore processo...
Shohei Gotoda, Naoki Shibata and Minoru Ito

Presentation
324views
14 years 23 days ago
Task scheduling algorithm for multicore processor system for minimizing recovery time in case of single node fault
In this paper, we propose a task scheduling al-gorithm for a multicore processor system which reduces the recovery time in case of a single fail-stop failure of a multicore process...
PODC
2009
ACM
16 years 7 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
EDOC
2008
IEEE
16 years 1 months ago
Facebook Meets the Virtualized Enterprise
: “Web 2.0” and “cloud computing” are revolutionizing the way IT infrastructure is accessed and managed. Web 2.0 technologies such as blogs, wikis and social networking pla...
Roger Curry, Cameron Kiddle, Nayden Markatchev, Ro...
« Prev « First page 2710 / 3232 Last » Next »