Sciweavers

2252 search results - page 314 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
SPAA
2009
ACM
16 years 4 months ago
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
We consider the setting of a multiprocessor where the speeds of the m processors can be individually scaled. Jobs arrive over time and have varying degrees of parallelizability. A...
Ho-Leung Chan, Jeff Edmonds, Kirk Pruhs
144
Voted
SSD
2001
Springer
120views Database» more  SSD 2001»
15 years 7 months ago
On Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern da...
Hongjun Zhu, Jianwen Su, Oscar H. Ibarra
137
Voted
SIROCCO
2007
15 years 4 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
PLDI
1997
ACM
15 years 7 months ago
Dynamic Feedback: An Effective Technique for Adaptive Computing
This paper presents dynamic feedback, a technique that enables computations to adapt dynamically to different execution environments. A compiler that uses dynamic feedback produce...
Pedro C. Diniz, Martin C. Rinard
257
Voted
RTAS
2011
IEEE
14 years 7 months ago
FPZL Schedulability Analysis
— This paper presents the Fixed Priority until Zero Laxity (FPZL) scheduling algorithm for multiprocessor realtime systems. FPZL is similar to global fixed priority preemptive sc...
Robert I. Davis, Alan Burns