Sciweavers

331 search results - page 49 / 67
» A Parallel Algorithm for Compile-Time Scheduling of Parallel...
Sort
View
NCA
2007
IEEE
14 years 1 months ago
Improving Network Processing Concurrency using TCPServers
Exponentially growing bandwidth requirements and slowing gains in processor speeds have led to the popularity of multiprocessor architectures. Network stack parallelism is increas...
Aniruddha Bohra, Liviu Iftode
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 7 months ago
The Complexity of Mean Flow Time Scheduling Problems with Release Times
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
Philippe Baptiste, Peter Brucker, Marek Chrobak, C...
GRID
2006
Springer
13 years 7 months ago
Simultaneous Scheduling of Replication and Computation for Data-Intensive Applications on the Grid
One of the first motivations of using grids comes from applications managing large data sets in field such as high energy physics or life sciences. To improve the global throughput...
Frederic Desprez, Antoine Vernois
IISWC
2009
IEEE
14 years 2 months ago
Phoenix rebirth: Scalable MapReduce on a large-scale shared-memory system
Abstract—Dynamic runtimes can simplify parallel programming by automatically managing concurrency and locality without further burdening the programmer. Nevertheless, implementin...
Richard M. Yoo, Anthony Romano, Christos Kozyrakis
IPPS
2000
IEEE
13 years 12 months ago
Online Computation of Critical Paths for Multithreaded Languages
We have developed an instrumentation scheme that enables programs written in multithreaded languages to compute a critical path at run time.Our scheme gives not only the length (ex...
Yoshihiro Oyama, Kenjiro Taura, Akinori Yonezawa