Sciweavers

550 search results - page 86 / 110
» Inherently Parallel Geometric Computations
Sort
View
103
Voted
GRID
2005
Springer
15 years 6 months ago
Protecting grid data transfer services with active network interfaces
A key goal of grid computing is to provide seamless access to shared computational and data resources across organizational boundaries, in distributed virtual organizations. Grid ...
Onur Demir, Michael R. Head, Kanad Ghose, Madhusud...
ICDE
2009
IEEE
114views Database» more  ICDE 2009»
16 years 2 months ago
On Efficient Query Processing of Stream Counts on the Cell Processor
In recent years, the sketch-based technique has been presented as an effective method for counting stream items on processors with limited storage and processing capabilities, such...
Dina Thomas, Rajesh Bordawekar, Charu C. Aggarwal,...
115
Voted
ICALP
2009
Springer
16 years 22 days ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
IPPS
2003
IEEE
15 years 5 months ago
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
117
Voted
FTTCS
2006
132views more  FTTCS 2006»
15 years 13 days ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter