检索结果-内蒙古大学图书馆

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 (log log n) time O(n³ log n) work optimally fast, optimal parallel CRCW-PRAM algorithm for detecting all repetitions of certain type in an n × n array. © 2005 Elsevier Ltd. All rights reserved.

关键词： 2D array optimal parallel algorithm repetition tandem

来源：评论

学校读者我要写书评

暂无评论

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 standard becomes invalid here. Through this research on broadcast algorithms under several typical parallel computation models,a model-independent evaluation standard min C2 is developed, which can be not only used to determine an optimal broadcasting algorithm, but also normalized to apply to any parallel algorithm. As a new idea, min C2 will lead to a new way in this field.

关键词： optimal parallel algorithm broadcast-class problem parallel computation model min C^2

来源：评论

学校读者我要写书评

暂无评论

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.

关键词： CONSTANT TIME CRCW-PRAM LION HUNTING optimal parallel algorithm PERIOD STRING MATCHING

来源：评论

学校读者我要写书评

暂无评论

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 truly parallel priority queue based on a heap structure. Employing p processors, the parallel heap allows deletions of THETA(p) highest priority items and insertions of THETA(p) new items, each in O(log n) time, where n is the size of the parallel heap. Furthermore, it can efficiently utilize processors in the range 1 through n.

关键词： parallel DATA STRUCTURE HEAP PRIORITY QUEUE optimal parallel algorithm parallel RANDOM ACCESS MACHINE

来源：评论

学校读者我要写书评

暂无评论

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 memory model where concurrent reads are allowed but no two processors can simultaneously attempt to write in the same memory location (even if they are trying to write the same thing).

关键词： CREW-PRAM model maximal elements problem in the plane optimal parallel algorithm parallel computation

来源：评论

学校读者我要写书评

暂无评论

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, and in computer graphics. Given R 1 , R 2 , …, R n a list of n iso-oriented rectangles in a plane, the measure problem computes the area of the region R, where R = R 1 ∪ R 2 ∪ ⋯ ∪ R n . The parallel algorithm presented in this paper is shown to have a tim complexity of O(log n log log n) with O(n/log log n ) processors.

关键词： complexity analysis divide and conquer strategy Measure problem optimal parallel algorithm VLSI design

来源：评论

学校读者我要写书评

暂无评论

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. The algorithm, called iterated bucket sort, is an improvement over the algorithm given by Chlebus, where the input integer keys were restricted to be of linear magnitude.

关键词： Integer sorting optimal parallel algorithm analysis of algorithms

来源：评论

学校读者我要写书评

暂无评论

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... 详细信息

关键词： Analysis of algorithms integer sorting optimal parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

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... 详细信息

关键词： Bracket language parsing complexity optimal parallel algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：