Sciweavers

3256 search results - page 394 / 652
» Mixin-Based Programming in C
Sort
View
DAM
2007
107views more  DAM 2007»
15 years 16 days ago
Eliminating graphs by means of parallel knock-out schemes
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
Hajo Broersma, Fedor V. Fomin, Rastislav Kralovic,...
PODC
2011
ACM
14 years 3 months ago
Structuring unreliable radio networks
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
Keren Censor-Hillel, Seth Gilbert, Fabian Kuhn, Na...
180
Voted
ASPLOS
2009
ACM
16 years 1 months ago
Capo: a software-hardware interface for practical deterministic multiprocessor replay
While deterministic replay of parallel programs is a powerful technique, current proposals have shortcomings. Specifically, software-based replay systems have high overheads on mu...
Pablo Montesinos, Matthew Hicks, Samuel T. King, J...
99
Voted
SIGCSE
2009
ACM
193views Education» more  SIGCSE 2009»
16 years 1 months ago
Seattle: a platform for educational cloud computing
Cloud computing is rapidly increasing in popularity. Companies such as RedHat, Microsoft, Amazon, Google, and IBM are increasingly funding cloud computing infrastructure and resea...
Justin Cappos, Ivan Beschastnikh, Arvind Krishnamu...
110
Voted
MOBIHOC
2008
ACM
16 years 5 days ago
Improving sensor network immunity under worm attacks: a software diversity approach
Because of cost and resource constraints, sensor nodes do not have a complicated hardware architecture or operating system to protect program safety. Hence, the notorious buffer-o...
Yi Yang, Sencun Zhu, Guohong Cao