Browsing by Subject "Sorting"

Now showing items 1-4 of 4

    • Article  

      A combinatorial treatment of balancing networks 

      Busch, Costas; Mavronicolas, Marios (1996)
      Balancing networks, originally introduced by Aspnes et al. (Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 348-358, May 1991), represent a new class of distributed, low-contention data structures ...
    • Conference Object  

      FSort: External sorting on flash-based sensor devices 

      Andreou, Panayiotis G.; Spanos, O.; Zeinalipour-Yazdi, Constantinos D.; Samaras, George S.; Chrysanthis, Panos K. (2009)
      In long-term deployments of Wireless Sensor Networks, it is often more efficient to store sensor readings locally at each device and transmit those readings to the user only when requested (i.e., in response to a user ...
    • Conference Object  

      A randomized, O(log w)-depth 2-smoothing network 

      Mavronicolas, Marios; Sauerwald, T. (2009)
      A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous propagation through the network. The maximum ...
    • Book Chapter  

      Results of parallel implementations of the selection problem using sisal 

      Daumas, Marc; Evripidou, Paraskevas (Publ by Elsevier Science Publishers B.V., 1993)
      This paper presents an in depth analysis on the parallel implementation of four of the standard selection algorithms using a functional language on a number of multiprocessor and supercomputers. Three of the algorithms: ...