We observe that for n/p ≥ p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting algorithm with 24 communication rounds (6 n p -relations and 18 p-relations), O(n/p) memory per processor and O(n/p) local computation.

The sorting number of a graph with n vertices is the minimum depth of a sorting network with n inputs and outputs that uses only the edges of the graph to perform comparisons. Many known results on sorting networks can be stated in terms of sorting numbers of different classes of graphs. In this we show that the following general results about the sorting number of graphs. 1. Any n-vertex graph...

It is important to have the accuracy sorting plan for the save of postman work time and the fast delivery of the receipt mail. It’s also very important to plan the proper carrier sorting plan at the situation where the number of pocket of letter sorting machine [LSM] is less than the number of postal code or the number of carrier. This paper describes the method for the carrier sorting plan and...

Selection of spermatozoa is one the most important factors that influence embryonic development and clinical outcome in intracytoplasmic sperm injection (ICSI). Intracytoplasmic morphologically selected (IMSI) a technique selects only according to their features under high magnification. However, there another selection uses hyaluronic acid (HA) select physiologically mature (HA-ICSI). The purp...

A new sorting network with exactly the same size and depth as the odd-even sorting network is presented. This sorting network is designed using the zero-one principle, and proceeds by first sorting pairs of bits and sorting the pairs into lexicographic order.

Polarized distribution of plasma membrane transporters and receptors in epithelia is essential for vectorial functions of epithelia. This polarity is maintained by sorting of membrane proteins into apical or basolateral transport containers in the trans-Golgi network and/or endosomes followed by their delivery to the appropriate plasma membrane domains. Sorting depends on the recognition of sor...

Sorting is still one of the most important problems in Computer Science. Work in transformational programming and automatic program synthesis provided the insight that led to Merritt’s inverted taxonomy of sorting algorithms, a high-level, top-down, conceptually simple and symmetric categorization of sorting algorithms. More recent work in logic-based program synthesis by Lau has produced a log...