咨询与建议

限定检索结果

文献类型

  • 9 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

  • 8 篇 工学
    • 7 篇 计算机科学与技术...
    • 1 篇 电气工程
    • 1 篇 信息与通信工程
    • 1 篇 软件工程
  • 1 篇 理学
    • 1 篇 数学

主题

  • 9 篇 optimal parallel...
  • 2 篇 analysis of algo...
  • 2 篇 integer sorting
  • 1 篇 tandem
  • 1 篇 vlsi design
  • 1 篇 crew-pram model
  • 1 篇 broadcast-class ...
  • 1 篇 complexity analy...
  • 1 篇 period
  • 1 篇 bracket language
  • 1 篇 parsing
  • 1 篇 parallel random ...
  • 1 篇 parallel computa...
  • 1 篇 parallel data st...
  • 1 篇 lion hunting
  • 1 篇 string matching
  • 1 篇 heap
  • 1 篇 2d array
  • 1 篇 parallel computa...
  • 1 篇 constant time

机构

  • 1 篇 univ salerno dep...
  • 1 篇 department of co...
  • 1 篇 departmentofcomp...
  • 1 篇 department of ma...
  • 1 篇 columbia univ de...
  • 1 篇 georgia state un...
  • 1 篇 inst. inf. univ....
  • 1 篇 univ warsaw inst...
  • 1 篇 tel aviv univ il...
  • 1 篇 electrotech lab ...
  • 1 篇 slovak acad sci ...

作者

  • 1 篇 寿标
  • 1 篇 miyakawa m
  • 1 篇 zubair m
  • 1 篇 giancarlo r
  • 1 篇 chlebus bs
  • 1 篇 李晓峰
  • 1 篇 stojmenovic i
  • 1 篇 brimkov valentin...
  • 1 篇 prasad s
  • 1 篇 galil z
  • 1 篇 郑世荣
  • 1 篇 deo n
  • 1 篇 rytter w
  • 1 篇 clebus bs

语言

  • 9 篇 英文
检索条件"主题词=Optimal parallel algorithm"
9 条 记 录,以下是1-10 订阅
排序:
AN optimal parallel algorithm FOR SOLVING THE MAXIMAL ELEMENTS PROBLEM IN THE PLANE
收藏 引用
parallel COMPUTING 1988年 第2期7卷 249-251页
作者: STOJMENOVIC, I MIYAKAWA, M ELECTROTECH LAB TSUKUBAIBARAKI 305JAPAN
We describe an O(log( n )) time with O( n ) processors optimal algorithm for finding the maximal elements of a set. The model of parallel computation we consider is the CREW-PRAM, i.e. it is the synchronous shared mem... 详细信息
来源: 评论
A CONSTANT-TIME optimal parallel STRING-MATCHING algorithm
收藏 引用
JOURNAL OF THE ASSOCIATION FOR COMPUTING MACHINERY 1995年 第4期42卷 908-918页
作者: GALIL, Z TEL AVIV UNIV IL-69978 TEL AVIVISRAEL
Given a pattern string, we describe a way to preprocess it. We design a CRCW-PRAM constant-time optimal parallel algorithm for finding all occurrences of the (preprocessed) pattern in any given text.
来源: 评论
Research on the optimal parallel algorithms of Broadcast-Class Problems
收藏 引用
Journal of Computer Science & Technology 1998年 第5期13卷 455-463页
作者: 李晓峰 寿标 郑世荣 DepartmentofComputerScience UniversityofScienceandTecnologyofChinaHefei230027PR.China
Speedup is considered as the criterion of determining whether a parallel algorithm is optimal. But broadcast-class problems, existing only on parallel computer system, have no sequential algorithms at all. Speedup sta... 详细信息
来源: 评论
optimal parallel PARSING OF BRACKET LANGUAGES
收藏 引用
THEORETICAL COMPUTER SCIENCE 1987年 第2-3期53卷 295-306页
作者: RYTTER, W GIANCARLO, R UNIV WARSAW INST INFORMAT PL-00901 WARSAW POLAND UNIV SALERNO DEPT INFORMAT I-84100 SALERNO ITALY COLUMBIA UNIV DEPT COMP SCI NEW YORK NY 10027 USA
We prove that the parsing problem for bracket context-free languages can be solved in log n time using n /log n processors on a parallel random access machine without write conflicts (P-RAM). On the way we develop a n... 详细信息
来源: 评论
parallel HEAP - AN optimal parallel PRIORITY QUEUE
收藏 引用
JOURNAL OF SUPERCOMPUTING 1992年 第1期6卷 87-98页
作者: DEO, N PRASAD, S GEORGIA STATE UNIV DEPT MATH & COMP SCIATLANTAGA 30303
We describe a new parallel data structure, namely parallel heap, for exclusive-read exclusive-write parallel random access machines. To our knowledge, it is the first such data structure to efficiently implement a tru... 详细信息
来源: 评论
optimal parallel Searching an Array for Certain Repetitions
收藏 引用
Electronic Notes in Discrete Mathematics 2003年 12卷 82-93页
作者: Brimkov, Valentin E. Department of Mathematics and Computer Science SUNY Fredonia NY United States
Repetitive substructures of two-dimensional arrays have been recently defined and studied in an attempt to parallel some of the analogous developments already known for strings. In the present paper we propose an O (l... 详细信息
来源: 评论
AN optimal SPEEDUP algorithm FOR THE MEASURE PROBLEM
收藏 引用
parallel COMPUTING 1990年 第1期13卷 61-71页
作者: ZUBAIR, M Department of Computer Science Old Dominion University Norfolk VA 23529 USA
In this paper we present an optimal speedup parallel algorithm for the measure problem. The measure problem arises in layout verification problems for VLSI designs, in geography, in maintaining architectural databases... 详细信息
来源: 评论
A parallel BUCKET SORT
收藏 引用
INFORMATION PROCESSING LETTERS 1988年 第2期27卷 57-61页
作者: CLEBUS, BS SLOVAK ACAD SCI INST TECH CYBERNETCS-80936 BRATISLAVACZECHOSLOVAKIA
The problem to sort integers on a parallel RAM (PRAM) is investigated. An algorithm sorting n integers on n/log n processors in expected time O(log n) is presented. It is a parallel version of the bucket sort. The sim... 详细信息
来源: 评论
parallel ITERATED BUCKET SORT
收藏 引用
INFORMATION PROCESSING LETTERS 1989年 第4期31卷 181-183页
作者: CHLEBUS, BS Inst. Inf. Univ. Warszawski PKiN p. 850 00-901 Warsaw Poland
The authors develop a parallel algorithm sorting n integers, drawn randomly from a polynominal range, on a CRCW PRAM, using n/log n processors in time O(log n) with probability 1-2 super(-bn/log3n), for some b > 0.... 详细信息
来源: 评论