咨询与建议

限定检索结果

文献类型

  • 2 篇 期刊文献
  • 2 篇 会议

馆藏范围

  • 4 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 3 篇 工学
    • 3 篇 计算机科学与技术...
    • 1 篇 软件工程

主题

  • 4 篇 parallel disk mo...
  • 2 篇 online algorithm...
  • 1 篇 file systems
  • 1 篇 parallelism
  • 1 篇 competitive anal...
  • 1 篇 sorting
  • 1 篇 algorithms
  • 1 篇 external memory
  • 1 篇 massive data set...
  • 1 篇 input/output
  • 1 篇 disk sorting
  • 1 篇 data distributio...
  • 1 篇 randomized algor...

机构

  • 1 篇 purdue universit...
  • 1 篇 purdue univ coll...
  • 1 篇 rice univ dept e...
  • 1 篇 louisiana state ...
  • 1 篇 dartmouth colleg...
  • 1 篇 natl tsing hua u...
  • 1 篇 univ connecticut...
  • 1 篇 purdue universit...
  • 1 篇 rice university ...

作者

  • 1 篇 jeffrey scott vi...
  • 1 篇 hirschl m
  • 1 篇 peter j. varman
  • 1 篇 rahul shah
  • 1 篇 varman peter j.
  • 1 篇 cormen th
  • 1 篇 rajasekaran sang...
  • 1 篇 vitter jeffrey s...
  • 1 篇 shah rahul
  • 1 篇 kundeti vamsi
  • 1 篇 hon wing-kai

语言

  • 4 篇 英文
检索条件"主题词=Parallel Disk Model"
4 条 记 录,以下是1-10 订阅
排序:
Early experiences in evaluating the parallel disk model with the ViC* implementation
收藏 引用
parallel COMPUTING 1997年 第4-5期23卷 571-600页
作者: Cormen, TH Hirschl, M Dartmouth College Department of Computer Science Hanover NH 03755-3510 USA
Although several algorithms have been developed for the parallel disk model (PDM), few have been implemented, Consequently, little has been known about the accuracy of the PDM in measuring I/O time and total running t... 详细信息
来源: 评论
Efficient out-of-core sorting algorithms for the parallel disks model
收藏 引用
JOURNAL OF parallel AND DISTRIBUTED COMPUTING 2011年 第11期71卷 1427-1433页
作者: Kundeti, Vamsi Rajasekaran, Sanguthevar Univ Connecticut Dept Comp Sci & Engn Storrs CT 06269 USA
In this paper,(1) we present efficient algorithms for sorting on the parallel disks model (PDM). Numerous asymptotically optimal algorithms have been proposed in the literature. However, many of these merge based algo... 详细信息
来源: 评论
Tight Competitive Ratios for parallel disk Prefetching and Caching  08
Tight Competitive Ratios for Parallel Disk Prefetching and C...
收藏 引用
20th ACM Symposium on parallelism in Algorithms and Architectures
作者: Hon, Wing-Kai Shah, Rahul Varman, Peter J. Vitter, Jeffrey Scott Natl Tsing Hua Univ Dept Comp Sci Hsinchu Taiwan Louisiana State Univ Dept Comp Sci Baton Rouge LA 70803 USA Rice Univ Dept ECE Houston TX 77251 USA Purdue Univ Coll Sci W Lafayette IN 47907 USA
We consider the natural extension of the well-known single disk caching problem to the parallel disk I/O model (PDM) [17]. The main challenge is to achieve as much parallelism as possible and avoid I/O bottlenecks. We... 详细信息
来源: 评论
On competitive online read-many parallel disks scheduling  05
On competitive online read-many parallel disks scheduling
收藏 引用
Proceedings of the seventeenth annual ACM symposium on parallelism in algorithms and architectures
作者: Rahul Shah Peter J. Varman Jeffrey Scott Vitter Purdue University West Lafayette IN Rice University Houston TX Purdue University West Lafayatte IN
We consider the natural extension of the single disk caching problem to parallel disk I/O model. We close the existing gap between lower and upper bounds and achieve optimal competitive ratio of O(√D) when lookahead ... 详细信息
来源: 评论