Sciweavers

680 search results - page 50 / 136
» A randomized embedding algorithm for trees
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
Average Execution Time Analysis of a Self-stabilizing Leader Election Algorithm
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...
Juan Paulo Alvarado-Magaña, José Alb...
RTAS
2010
IEEE
13 years 6 months ago
Improved Task Management Techniques for Enforcing EDF Scheduling on Recurring Tasks
The management of tasks is an essential requirement in most real-time and embedded systems, but invariably leads to unwanted CPU overheads. This paper is concerned with task manage...
Michael Short
DATE
2007
IEEE
138views Hardware» more  DATE 2007»
14 years 26 days ago
Energy minimization with soft real-time and DVS for uniprocessor and multiprocessor embedded systems
Energy-saving is extremely important in real-time embedded systems. Dynamic Voltage Scaling (DVS) is one of the prime techniques used to achieve energy-saving. Due to the uncertai...
Meikang Qiu, Chun Xue, Zili Shao, Edwin Hsing-Mean...
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 10 months ago
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to traditional sequential data structures, distributed data st...
Kevin C. Zatloukal, Nicholas J. A. Harvey
RSA
2008
123views more  RSA 2008»
13 years 8 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang