Sciweavers

575 search results - page 47 / 115
» Computing Maximum Subsequence in Parallel
Sort
View
IPPS
1998
IEEE
13 years 12 months ago
Efficient Runtime Thread Management for the Nano-Threads Programming Model
Abstract. The nano-threads programming model was proposed to effectively integrate multiprogramming on shared-memory multiprocessors, with the exploitation of fine-grain parallelis...
Dimitrios S. Nikolopoulos, Eleftherios D. Polychro...
ICPP
2009
IEEE
14 years 2 months ago
Accelerating Lattice Boltzmann Fluid Flow Simulations Using Graphics Processors
—Lattice Boltzmann Methods (LBM) are used for the computational simulation of Newtonian fluid dynamics. LBM-based simulations are readily parallelizable; they have been implemen...
Peter Bailey, Joe Myre, Stuart D. C. Walsh, David ...
IPPS
2006
IEEE
14 years 1 months ago
A probabilistic approach for fault tolerant multiprocessor real-time scheduling
In this paper we tackle the problem of scheduling a periodic real-time system on identical multiprocessor platforms, moreover the tasks considered may fail with a given probabilit...
Vandy Berten, Joël Goossens, Emmanuel Jeannot
CCGRID
2010
IEEE
13 years 8 months ago
SLA-Driven Dynamic Resource Management for Multi-tier Web Applications in a Cloud
Current service-level agreements (SLAs) offered by cloud providers do not make guarantees about response time of Web applications hosted on the cloud. Satisfying a maximum average ...
Waheed Iqbal, Matthew N. Dailey, David Carrera
TKDE
2012
278views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Data Cube Materialization and Mining over MapReduce
—Computing interesting measures for data cubes and subsequent mining of interesting cube groups over massive datasets are critical for many important analyses done in the real wo...
Arnab Nandi, Cong Yu, Philip Bohannon, Raghu Ramak...