Sciweavers

405 search results - page 64 / 81
» A Parallel Priority Data Structure with Applications
Sort
View
CLUSTER
2005
IEEE
15 years 5 months ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
ICDE
2006
IEEE
206views Database» more  ICDE 2006»
16 years 1 months ago
Query Co-Processing on Commodity Hardware
The rapid increase in the data volumes for the past few decades has intensified the need for high processing power for database and data mining applications. Researchers have acti...
Anastassia Ailamaki, Naga K. Govindaraju, Dinesh M...
HIPC
2007
Springer
15 years 3 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
DATE
2004
IEEE
154views Hardware» more  DATE 2004»
15 years 3 months ago
MultiNoC: A Multiprocessing System Enabled by a Network on Chip
The MultiNoC system implements a programmable onchip multiprocessing platform built on top of an efficient, low area overhead intra-chip interconnection scheme. The employed inter...
Aline Mello, Leandro Möller, Ney Calazans, Fe...
CCGRID
2002
IEEE
15 years 4 months ago
MS-I/O: A Distributed Multi-Storage I/O System
More and more parallel applications are running in a distributed environment to take advantage of easily available and inexpensive commodity resources. For data intensive applicat...
Xiaohui Shen, Alok N. Choudhary