In this paper, we present a re-circulating systolic sorting array and two sorting algorithms. The correctness of these algorithms is proved and general operational constraints are examined. These algorithms are amenab...
详细信息
In this paper, we present a re-circulating systolic sorting array and two sorting algorithms. The correctness of these algorithms is proved and general operational constraints are examined. These algorithms are amenable to VLSI implementation owing to the following attributes: (1) the simple control patterns of the algorithms, (2) the regular, repetitive and near-neigbour type of interconnection among the comparators, and (3) the systolic data movement. The sorting array is also well-suited for fabrication on shift-register type of storage and logic devices–such as magnetic bubble memories (MBMs) and charge-coupled devices (CCDs)–because of its closed-loop structure. The number of comparators and sorting time are both inO(N)whereNis the number of items to be sorted. A hardware termination methods is incorporated into the control unit of the sorter, so that the sorting process can be terminated within a bounded time after the input list is in the desired order.
This article presents a general algorithm for prettyprinting and holophrasting interactively created objects. It is shown how an environment with knowledge of the entities it manipulates can automatically produce cath...
详细信息
This article presents a general algorithm for prettyprinting and holophrasting interactively created objects. It is shown how an environment with knowledge of the entities it manipulates can automatically produce cathode-ray tube displays with more helpful contextual information for the user than a traditional display of contiguous lines from a source file.
We consider a particular type of sorting where objects having the same weight go to the same destination. We call it regular fusion-sorting. We show that if in a sorting network built with sorting cells, we replace th...
详细信息
We consider a particular type of sorting where objects having the same weight go to the same destination. We call it regular fusion-sorting. We show that if in a sorting network built with sorting cells, we replace these cells by regular fusion-sorting cells, then the network becomes a regular fusion-sorting network. We give some applications, as the extraction of sets from multisets, occurrence counting in lists of objects, multiconnection networks.
Two versions of the parallel bucket sorting algorithm ensuring nearly optimal speedup on SIMD computers are considered. The algorithm is divided into two stages. In the first stage, the array elements are assigned to ...
详细信息
Two versions of the parallel bucket sorting algorithm ensuring nearly optimal speedup on SIMD computers are considered. The algorithm is divided into two stages. In the first stage, the array elements are assigned to buckets, and in the second stage the contents of all the buckets are sorted concurrently.
The author discusses the question of correctness (completeness and consistency) of decision tables. The concepts of syntactic and semantic correctness of decision tables are introduced. He investigates the possibility...
详细信息
The author discusses the question of correctness (completeness and consistency) of decision tables. The concepts of syntactic and semantic correctness of decision tables are introduced. He investigates the possibility of automating the process of checking the semantic correctness of a decision table.
It is shown that the problem of optimal overlaying of differently weighted variables generated in an operator schema in the large is reducible to a discrete programming problem. The problem is solved and a heuristic o...
详细信息
It is shown that the problem of optimal overlaying of differently weighted variables generated in an operator schema in the large is reducible to a discrete programming problem. The problem is solved and a heuristic overlay algorithm is proposed.
programming 'comments' are a more important aspect of documentation than is generally recognized. Often these comments, written into the program code, are the only form of documentation a maintenance programme...
详细信息
programming 'comments' are a more important aspect of documentation than is generally recognized. Often these comments, written into the program code, are the only form of documentation a maintenance programmer uses when trying to navigate an unfamiliar program. In theory they are the programmer's guide to how a program works. Comments are part of the 'internal' documentation written for the programmer, as differentiated from the end-user's manual. But the industry is, as yet, without a standard for such comments or a widely accepted format for their placement. As many companies have found, rarely does this internal documentation - which includes flowcharts, pseudo-code, and the listing itself, as well as the comments - contain all the information necessary for maintaining a program.
Generating permutations satisfying a U-D sequence, or having a given number of runs are shown to be restricted permutation problems which can be reduced to topological sorting. Algorithms for generating the solution s...
详细信息
Generating permutations satisfying a U-D sequence, or having a given number of runs are shown to be restricted permutation problems which can be reduced to topological sorting. Algorithms for generating the solution sets of such problems are outlined.
RPK Corporation has converted COSMIC/NASTRAN to the CRAY computersystems. The CRAY version is currently available and provides users with access to all of the machine-independent source code of COSMIC/NASTRAN. Future...
详细信息
RPK Corporation has converted COSMIC/NASTRAN to the CRAY computersystems. The CRAY version is currently available and provides users with access to all of the machine-independent source code of COSMIC/NASTRAN. Future releases of COSMIC/NASTRAN will be made available on the CRAY by RPK soon after they are released by COSMIC.
N. Megiddo (J. ACM, vol. 30, no. 4, pp. 852-865, Oct. 1983) introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. A general method is gi...
详细信息
ISBN:
(纸本)081860591X
N. Megiddo (J. ACM, vol. 30, no. 4, pp. 852-865, Oct. 1983) introduced a technique for using a parallel algorithm for one problem to construct an efficient serial algorithm for a second problem. A general method is given that trims a factor of O(log n) time (or more) for many applications of this technique.
暂无评论