Sciweavers

9477 search results - page 1544 / 1896
» Design is as Easy as Optimization
Sort
View
186
Voted
CCGRID
2009
IEEE
16 years 1 months ago
Improving Parallel Write by Node-Level Request Scheduling
In a cluster of multiple processors or cpu-cores, many processes may run on each compute node. Each process tends to issue contiguous I/O requests for snapshot, checkpointing or s...
Kazuki Ohta, Hiroya Matsuba, Yutaka Ishikawa
CEC
2009
IEEE
16 years 1 months ago
Theoretical analysis of rank-based mutation - combining exploration and exploitation
— Parameter setting is an important issue in the design of evolutionary algorithms. Recently, experimental work has pointed out that it is often not useful to work with a fixed ...
Pietro Simone Oliveto, Per Kristian Lehre, Frank N...
DATE
2009
IEEE
89views Hardware» more  DATE 2009»
16 years 1 months ago
Robust non-preemptive hard real-time scheduling for clustered multicore platforms
—Scheduling task graphs under hard (end-to-end) timing constraints is an extensively studied NP-hard problem of critical importance for predictable software mapping on Multiproce...
Michele Lombardi, Michela Milano, Luca Benini
DEXAW
2009
IEEE
129views Database» more  DEXAW 2009»
16 years 1 months ago
RDFStats - An Extensible RDF Statistics Generator and Library
—In this paper RDFStats is introduced, which is a generator for statistics of RDF sources like SPARQL endpoints and RDF documents. RDFStats does not only provide a statistics gen...
Andreas Langegger, Wolfram Wöß
GLOBECOM
2009
IEEE
16 years 1 months ago
Local Estimation of Probabilities of Direct and Staggered Collisions in 802.11 WLANs
—Current 802.11 networks do not typically achieve the maximum potential throughput despite link adaptation and crosslayer optimization techniques designed to alleviate many cause...
Michael N. Krishnan, Sofie Pollin, Avideh Zakhor
« Prev « First page 1544 / 1896 Last » Next »