نتایج جستجو برای: sorting
تعداد نتایج: 31379 فیلتر نتایج به سال:
The delivery to the plasma membrane of the general amino acid permease, Gap1p, of Saccharomyces cerevisiae is regulated by the quality of the nitrogen source in the growth medium. In an effort to define how different nitrogen sources control Gap1p sorting, we find that mutations in GDH1 and GLN1 that decrease the flux through the glutamate and glutamine synthesis pathways result in increased Ga...
This paper revisits the pairwise sorting network introduced by Parberry in the early 90’s. We provide a simple specification of the pairwise network which also clarifies its close resemblance to the more classic odd-even network introduced by Batcher in the mid 60’s. Finally we illustrate that pairwise networks are better suited than odd-even networks for the construction of selection networks.
This paper presents and analyzes algorithms for parallel execution of sort operations in a general multiprocessor architecture. We consider both internal and external sorting algorithms. For the latter, we study the performance of sorting algorithms that are derived from sorting algorithms that only do comparison and exchange by replacing each comparison-exchange with a B-way merge. In particul...
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorting algorithms is Bitonic Sort, which is represented by a sorting network consisting of multiple butterfly stages. This paper studies bitonic sort on modern parallel machines which are relatively coarse grained and cons...
Fast Parallel Space Allocation, Estimation and Integer Sorting (revised) •
This paper studies properties of the back end of a sorting network and illustrates the utility of these in the search for networks of optimal size or depth. All previous works focus on properties of the front end of networks and on how to apply these to break symmetries in the search. The new properties help shed understanding on how sorting networks sort and speed-up solvers for both optimal s...
v CHAPTER
Thepancake problemasks for theminimumnumber of prefix reversals sufficient for sorting any permutation of length n. We improve the upper bound for the pancake problem to (18/11)n+ O(1) ≈ (1.6363)n. © 2008 Elsevier B.V. All rights reserved.
The main contribution of this work is to present a simple sorting algorithm for the broadcast communication model (BCM, for short). With a sequence on n items as input, our algorithm runs in O(n p log n p + n k + log k) time on a p-processor, k-channel BCM, a considerable improvement over the state of the art.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید