Sciweavers

77 search results - page 10 / 16
» UNIX Disk Access Patterns
Sort
View
CLUSTER
2006
IEEE
14 years 3 months ago
An Iteration Aware Multidimensional Data Distribution Prototype for Computing Clusters
Disk and network latency must be taken into account when applying parallel computing to large multidimensional datasets because they can hinder performance by reducing the rate at...
Baoqiang Yan, Philip J. Rhodes
KDD
2010
ACM
222views Data Mining» more  KDD 2010»
13 years 11 months ago
Large linear classification when data cannot fit in memory
Recent advances in linear classification have shown that for applications such as document classification, the training can be extremely efficient. However, most of the existing t...
Hsiang-Fu Yu, Cho-Jui Hsieh, Kai-Wei Chang, Chih-J...
PSB
2003
13 years 11 months ago
MAP: Searching Large Genome Databases
A number of biological applications require comparison of large genome strings. Current techniques suffer from both disk I/O and computational cost because of extensive memory req...
Tamer Kahveci, Ambuj K. Singh
3DIC
2009
IEEE
169views Hardware» more  3DIC 2009»
14 years 2 months ago
3-D memory organization and performance analysis for multi-processor network-on-chip architecture
Several forms of processor memory organizations have been in use to optimally access off-chip memory systems mainly the Hard disk drives (HDD). Recent trends show that the solid s...
Awet Yemane Weldezion, Zhonghai Lu, Roshan Weerase...
WAE
2000
128views Algorithms» more  WAE 2000»
13 years 11 months ago
Planar Point Location for Large Data Sets: To Seek or Not to Seek
We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket metho...
Jan Vahrenhold, Klaus Hinrichs