咨询与建议

限定检索结果

文献类型

  • 347 篇 会议
  • 18 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 251 篇 工学
    • 248 篇 计算机科学与技术...
    • 165 篇 软件工程
    • 25 篇 电气工程
    • 23 篇 信息与通信工程
    • 17 篇 控制科学与工程
    • 5 篇 电子科学与技术(可...
    • 4 篇 农业工程
    • 4 篇 生物工程
    • 3 篇 生物医学工程(可授...
    • 2 篇 机械工程
    • 2 篇 化学工程与技术
    • 1 篇 材料科学与工程(可...
    • 1 篇 建筑学
  • 147 篇 理学
    • 143 篇 数学
    • 23 篇 统计学(可授理学、...
    • 4 篇 生物学
    • 3 篇 系统科学
    • 2 篇 化学
  • 13 篇 管理学
    • 10 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 3 篇 图书情报与档案管...
  • 6 篇 农学
    • 6 篇 作物学
    • 2 篇 农业资源与环境
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 82 篇 parallel algorit...
  • 68 篇 parallel process...
  • 12 篇 parallel program...
  • 11 篇 computer program...
  • 9 篇 scheduling
  • 7 篇 computer archite...
  • 7 篇 pram
  • 6 篇 computer systems...
  • 5 篇 graph algorithms
  • 4 篇 performance
  • 4 篇 parallel archite...
  • 4 篇 multithreading
  • 4 篇 transactional me...
  • 4 篇 work stealing
  • 3 篇 parallel process...
  • 3 篇 parallelism
  • 3 篇 approximation al...
  • 3 篇 cilk
  • 3 篇 sorting
  • 3 篇 chip multiproces...

机构

  • 10 篇 carnegie mellon ...
  • 4 篇 carnegie mellon ...
  • 4 篇 univ of paderbor...
  • 3 篇 department of co...
  • 3 篇 university of ma...
  • 3 篇 mit 77 massachus...
  • 2 篇 duke univ durham...
  • 2 篇 univ calif river...
  • 2 篇 carnegie mellon ...
  • 2 篇 univ of toronto ...
  • 2 篇 dept. of compute...
  • 2 篇 at and t bell la...
  • 2 篇 sandia national ...
  • 2 篇 computer science...
  • 2 篇 univ of californ...
  • 2 篇 department of ma...
  • 2 篇 digital systems ...
  • 2 篇 t.j. watson rese...
  • 2 篇 max planck inst ...
  • 2 篇 bell laboratorie...

作者

  • 12 篇 gibbons phillip ...
  • 11 篇 blelloch guy e.
  • 6 篇 reif john h.
  • 6 篇 leiserson charle...
  • 5 篇 matias yossi
  • 4 篇 uzi vishkin
  • 4 篇 ramachandran vij...
  • 4 篇 vitter jeffrey s...
  • 4 篇 muthukrishnan s.
  • 4 篇 goodrich michael...
  • 4 篇 phillip b. gibbo...
  • 3 篇 snir marc
  • 3 篇 cormen thomas h.
  • 3 篇 deng xiaotie
  • 3 篇 tangwongsan kana...
  • 3 篇 sohn andrew
  • 3 篇 leighton tom
  • 3 篇 simhadri harsha ...
  • 3 篇 miller gary l.
  • 3 篇 gu yan

语言

  • 352 篇 英文
  • 13 篇 其他
检索条件"任意字段=Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures"
365 条 记 录,以下是121-130 订阅
排序:
parallel processor scheduling with delay constraints  01
Parallel processor scheduling with delay constraints
收藏 引用
proceedings of the twelfth annual acm-SIAM symposium on Discrete algorithms
作者: Daniel W. Engels Jon Feldman David R. Karger Matthias Ruhl MIT Laboratory for Computer Science Cambridge MA
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose a partial order on the jobs, and both ...
来源: 评论
Reconciling simplicity and realism in parallel disk models  01
Reconciling simplicity and realism in parallel disk models
收藏 引用
proceedings of the twelfth annual acm-SIAM symposium on Discrete algorithms
作者: Peter Sanders Max Planck Institut für Informatik Saarbrücken Germany
For the design and analysis of algorithms that process huge data sets, a machine model is needed that handles parallel disks. There seems to be a dilemma between simple and flexible use of such a model and accurate mo...
来源: 评论
Optimal prefetching and caching for parallel I/O sytems  01
Optimal prefetching and caching for parallel I/O sytems
收藏 引用
proceedings of the thirteenth annual acm symposium on parallel algorithms and architectures
作者: Mahesh Kallahalla Peter J. Varman Hewlett-Packard Labs 1501 Page Mill Rd. Palo Alto CA Department of ECE Rice University Houston TX
We address the problem of prefetching and caching in a parallel I/O system and present a new algorithm for optimal parallel-disk scheduling. Traditional buffer management algorithms that minimize the number of I/O dis...
来源: 评论
A no-busy-wait balanced tree parallel algorithmic paradigm  00
A no-busy-wait balanced tree parallel algorithmic paradigm
收藏 引用
proceedings of the twelfth annual acm symposium on parallel algorithms and architectures
作者: Uzi Vishkin University of Maryland
Suppose that a parallel algorithm can include any number of parallel threads. Each thread can proceed without ever having to busy wait to another thread. A thread can proceed till its termination, but no new threads c...
来源: 评论
Algorithmic foundations for a parallel vector access memory system  00
Algorithmic foundations for a parallel vector access memory ...
收藏 引用
proceedings of the twelfth annual acm symposium on parallel algorithms and architectures
作者: Binu K. Mathew Sally A. McKee John B. Carter Al Davis Department of Computer Science University of Utah Salt Lake City UT
This paper presents mathematical foundations for the design of a memory controller subcomponent that helps to bridge the processor/memory performance gap for applications with strided access patterns. The parallel Vec...
来源: 评论
Interprocessor communication with memory constraints  00
Interprocessor communication with memory constraints
收藏 引用
proceedings of the twelfth annual acm symposium on parallel algorithms and architectures
作者: Ali Pinar Bruce Hendrickson Department of Computer Science University of Illinois Urbana IL Parallel Computing Sciences Department Sandia National Laboratories Albuquerque NM
Many parallel applications require periodic redistribution of workloads and associated data. In a distributed memory computer, this redistribution can be difficult if limited memory is available for receiving messages...
来源: 评论
Multithreaded algorithms for the fast Fourier transform  00
Multithreaded algorithms for the fast Fourier transform
收藏 引用
proceedings of the twelfth annual acm symposium on parallel algorithms and architectures
作者: Parimala Thulasiraman Kevin B. Theobald Ashfaq A. Khokhar Guang R. Gao Department of Electrical and Computer Engineering 140 Evans Hall University of Delaware Newark DE
In this paper we present fine-grained multithreaded algorithms and implementations for the Fast Fourier Transform (FFT) problem. The FFT problem has been formulated using two distinct approaches based on the dataflow ... 详细信息
来源: 评论
Scheduling Cilk multithreaded parallel programs on processors of different speeds  00
Scheduling Cilk multithreaded parallel programs on processor...
收藏 引用
proceedings of the twelfth annual acm symposium on parallel algorithms and architectures
作者: Michael A. Bender Michael O. Rabin Department of Computer Science State University of New York at Stony Brook Stony Brook NY Division of Engineering and Applied Sciences Harvard University Cambridge MA
We study the problem of executing parallel programs, in particular Cilk programs, on a collection of processors of different speeds. We consider a model in which each processor maintains an estimate of its own speed, ...
来源: 评论
Optimal schedules for data-parallel cycle-stealing in networks of workstations (extended abstract)  00
Optimal schedules for data-parallel cycle-stealing in networ...
收藏 引用
proceedings of the twelfth annual acm symposium on parallel algorithms and architectures
作者: Arnold L. Rosenberg Department of Computer Science University of Massachusetts Amherst MA
We refine the model underlying our prior work on scheduling cycle-stealing opportunities in NOWs [5, 16], obtaining a model wherein the scheduling guidelines of [16] produce optimal schedules for every such opportunit...
来源: 评论
Infinite parallel job allocation (extended abstract)  00
Infinite parallel job allocation (extended abstract)
收藏 引用
proceedings of the twelfth annual acm symposium on parallel algorithms and architectures
作者: Petra Berenbrink Artur Czumaj Tom Friedetzky Nikita D. Vvedenskaya Dept. of Mathematics & Computer Science Paderborn University D-33095 Paderborn Germany Department of Computer and Information Science New Jersey Institute of Technology University Heights Newark NJ Institut für Informatik Technische Universität München D-80290 München Germany Institute of Information Transmission Problems Russian Academy of Science Moscow 101447 Russia
In recent years, the task of allocating jobs to servers has been studied with the “balls and bins” abstraction. Results in this area exploit the large decrease in maximum load that can be achieved by allowing each j...
来源: 评论