Sciweavers

6004 search results - page 1007 / 1201
» Parallelizing query optimization
Sort
View
STOC
2001
ACM
115views Algorithms» more  STOC 2001»
14 years 9 months ago
Running time and program size for self-assembled squares
Recently Rothemund and Winfree 6] have considered the program size complexity of constructing squares by selfassembly. Here, we consider the time complexity of such constructions ...
Leonard M. Adleman, Qi Cheng, Ashish Goel, Ming-De...
ICDCS
2009
IEEE
14 years 6 months ago
Graduated QoS by Decomposing Bursts: Don't Let the Tail Wag Your Server
The growing popularity of hosted storage services and shared storage infrastructure in data centers is driving the recent interest in resource management and QoS in storage system...
Lanyue Lu, Peter J. Varman, Kshitij Doshi
LCTRTS
2010
Springer
14 years 4 months ago
Elastic computing: a framework for transparent, portable, and adaptive multi-core heterogeneous computing
Over the past decade, system architectures have started on a clear trend towards increased parallelism and heterogeneity, often resulting in speedups of 10x to 100x. Despite numer...
John Robert Wernsing, Greg Stitt
CCGRID
2009
IEEE
14 years 3 months ago
Reliability-Oriented Genetic Algorithm for Workflow Applications Using Max-Min Strategy
— To optimize makespan and reliability for workflow applications, most existing works use list heuristics rather than genetic algorithms (GAs) which can usually give better solut...
Xiaofeng Wang, Rajkumar Buyya, Jinshu Su
EDOC
2009
IEEE
14 years 3 months ago
An End-to-End Approach for QoS-Aware Service Composition
Abstract—A simple and effective composition of software services into higher-level composite services is still a very challenging task. Especially in enterprise environments, Qua...
Florian Rosenberg, Predrag Celikovic, Anton Michlm...
« Prev « First page 1007 / 1201 Last » Next »