Sciweavers

21007 search results - page 4075 / 4202
» Mobile Parallel Computing
Sort
View
CORR
2010
Springer
128views Education» more  CORR 2010»
14 years 10 months ago
A Performance Study of GA and LSH in Multiprocessor Job Scheduling
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
S. R. Vijayalakshmi, G. Padmavathi
CORR
2002
Springer
136views Education» more  CORR 2002»
14 years 9 months ago
Libra: An Economy driven Job Scheduling System for Clusters
Clusters of computers have emerged as mainstream parallel and distributed platforms for high-performance, highthroughput and high-availability computing. To enable effective resou...
Jahanzeb Sherwani, Nosheen Ali, Nausheen Lotia, Za...
ETS
2000
IEEE
155views Hardware» more  ETS 2000»
14 years 9 months ago
Using technologies in teaching: an initiative in academic staff development
Academic staff development in the pedagogical applications of new technologies is fundamental to the transformation of teaching and learning in tertiary education settings. We pre...
Christine Spratt, Stuart Palmer, Jo Coldwell
TOG
2002
156views more  TOG 2002»
14 years 9 months ago
Chromium: a stream-processing framework for interactive rendering on clusters
We describe Chromium, a system for manipulating streams of graphics API commands on clusters of workstations. Chromium's stream filters can be arranged to create sort-first a...
Greg Humphreys, Mike Houston, Ren Ng, Randall Fran...
CORR
2010
Springer
142views Education» more  CORR 2010»
14 years 8 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna
« Prev « First page 4075 / 4202 Last » Next »