Sciweavers

299 search results - page 42 / 60
» DNA Computing for Complex Scheduling Problem
Sort
View
DAGSTUHL
2004
15 years 1 months ago
Simplicity Considered Fundamental to Design for Predictability
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
Wolfgang A. Halang
JDA
2008
85views more  JDA 2008»
14 years 11 months ago
A robust randomized algorithm to perform independent tasks
The Do-All problem is about scheduling t similar and independent tasks to be performed by p processors prone to crashes. We assume that the distributed system is synchronous with ...
Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Ko...
MST
2006
149views more  MST 2006»
14 years 11 months ago
Parameterized Intractability of Distinguishing Substring Selection
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
Jens Gramm, Jiong Guo, Rolf Niedermeier
PPOPP
2010
ACM
15 years 6 months ago
Thread to strand binding of parallel network applications in massive multi-threaded systems
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
Petar Radojkovic, Vladimir Cakarevic, Javier Verd&...
FGCS
2008
103views more  FGCS 2008»
14 years 11 months ago
A case for cooperative and incentive-based federation of distributed clusters
Research interest in Grid computing has grown significantly over the past five years. Management of distributed resources is one of the key issues in Grid computing. Central to ma...
Rajiv Ranjan, Aaron Harwood, Rajkumar Buyya