Sökning: "parallel sorting"
Visar resultat 1 - 5 av 25 avhandlingar innehållade orden parallel sorting.
1. Concurrent Algorithms and Data Structures for Many-Core Processors
Sammanfattning : The convergence of highly parallel many-core graphics processors with conventional multi-core processorsis becoming a reality.To allow algorithms and data structures to scale efficiently on these new platforms,several important factors needs to be considered. LÄS MER
2. New Results on Combinatorial Algorithms
Sammanfattning : In this thesis improved upper bounds for several important combinatorial problems are provided. Below is a list of the main results showed in the thesis. The problem of determining whether a k-connected partial k-tree is isomorphic to subgraph of another partial k-tree is shown to be solvable in time O(nk+2). LÄS MER
3. On adaptive sorting in sequential and parallel models
Sammanfattning : Sorting is probably the most well-studied problem in computer science. In many applications the elements to be sorted are not randomly distributed, but are already nearly ordered. Most existing algorithms do not take advantage of this fact. LÄS MER
4. Sport-sort : sorting algorithms and sport tournaments
Sammanfattning : Arrange a really short, thrilling and fair tournament! Execute parallel sorting in a machine of a new architecture! The author shows how these problems are connected. He designs several new tournament schemes, and analyses them both in theory and in extensive simulations. He uses only elementary mathematical and statistical methods. LÄS MER
5. Massively parallel analysis of cells and nucleic acids
Sammanfattning : Recent proceedings in biotechnology have enabled completely new avenues in life science research to be explored. By allowing increased parallelization an ever-increasing complexity of cell samples or experiments can be investigated in shorter time and at a lower cost. LÄS MER