Sciweavers

20778 search results - page 415 / 4156
» Algorithms for Data Migration
Sort
View
BCB
2010
156views Bioinformatics» more  BCB 2010»
15 years 1 months ago
Accelerating HMMER on GPUs by implementing hybrid data and task parallelism
Many biologically motivated problems are expressed as dynamic programming recurrences and are difficult to parallelize due to the intrinsic data dependencies in their algorithms. ...
Narayan Ganesan, Roger D. Chamberlain, Jeremy Buhl...
HPDC
2006
IEEE
16 years 25 days ago
Scheduling Mixed Workloads in Multi-grids: The Grid Execution Hierarchy
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We...
Mark Silberstein, Dan Geiger, Assaf Schuster, Miro...
173
Voted
ATAL
2005
Springer
16 years 10 days ago
Thespian: using multi-agent fitting to craft interactive drama
There has been a growing interest in designing multi-agent based interactive dramas. A key research challenge faced in the design of these systems is to support open-ended user in...
Mei Si, Stacy Marsella, David V. Pynadath
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 6 months ago
Online Scheduling on Identical Machines using SRPT
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
Kyle Fox, Benjamin Moseley
CC
2007
Springer
208views System Software» more  CC 2007»
16 years 29 days ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger