9,670 research outputs found
Asymptotic merging of nodes set for stochastic networks with nonhomogeneous input
When one investigate mathematical models of information-computing networks, data networks, and mobile communications, one of the main problems is connected with the large dimension of descriptive processes and complexity of the phase space of the stochastic model. To overcome such problems, the approach of asymptotic merging for nodes set of multichannel stochastic networks is proposed in the work.
For the first time the problem of asymptotic merging phase for complex stochastic systems was considered by V.S. Korolyuk. His works contain methodological aspects of this problem.
In our work we use the approach of asymptotic merging for investigation of multichannel stochastic networks as queueing networks operating in a heavy traffic regime. Input flows of calls are Poisson processes with their rates can be dependent on time. For such networks we consider a multidimensional service process that is a stochastic process indicating the number of calls at the nodes of the network at the instant of time.
Under heavy traffic conditions the service process of calls is studied for networks with generally distributed service times and two types of an input flow. For the service process of the merged network a limit Gaussian process is constructed. Due to the approach with merging, dimension of the limit process is reduced.Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tec
An Enhanced Multiway Sorting Network Based on n-Sorters
Merging-based sorting networks are an important family of sorting networks.
Most merge sorting networks are based on 2-way or multi-way merging algorithms
using 2-sorters as basic building blocks. An alternative is to use n-sorters,
instead of 2-sorters, as the basic building blocks so as to greatly reduce the
number of sorters as well as the latency. Based on a modified Leighton's
columnsort algorithm, an n-way merging algorithm, referred to as SS-Mk, that
uses n-sorters as basic building blocks was proposed. In this work, we first
propose a new multiway merging algorithm with n-sorters as basic building
blocks that merges n sorted lists of m values each in 1 + ceil(m/2) stages (n
<= m). Based on our merging algorithm, we also propose a sorting algorithm,
which requires O(N log2 N) basic sorters to sort N inputs. While the asymptotic
complexity (in terms of the required number of sorters) of our sorting
algorithm is the same as the SS-Mk, for wide ranges of N, our algorithm
requires fewer sorters than the SS-Mk. Finally, we consider a binary sorting
network, where the basic sorter is implemented in threshold logic and scales
linearly with the number of inputs, and compare the complexity in terms of the
required number of gates. For wide ranges of N, our algorithm requires fewer
gates than the SS-Mk.Comment: 13 pages, 14 figure
Coalitional Games in MISO Interference Channels: Epsilon-Core and Coalition Structure Stable Set
The multiple-input single-output interference channel is considered. Each
transmitter is assumed to know the channels between itself and all receivers
perfectly and the receivers are assumed to treat interference as additive
noise. In this setting, noncooperative transmission does not take into account
the interference generated at other receivers which generally leads to
inefficient performance of the links. To improve this situation, we study
cooperation between the links using coalitional games. The players (links) in a
coalition either perform zero forcing transmission or Wiener filter precoding
to each other. The -core is a solution concept for coalitional games
which takes into account the overhead required in coalition deviation. We
provide necessary and sufficient conditions for the strong and weak
-core of our coalitional game not to be empty with zero forcing
transmission. Since, the -core only considers the possibility of
joint cooperation of all links, we study coalitional games in partition form in
which several distinct coalitions can form. We propose a polynomial time
distributed coalition formation algorithm based on coalition merging and prove
that its solution lies in the coalition structure stable set of our coalition
formation game. Simulation results reveal the cooperation gains for different
coalition formation complexities and deviation overhead models.Comment: to appear in IEEE Transactions on Signal Processing, 14 pages, 14
figures, 3 table
An Efficient Multiway Mergesort for GPU Architectures
Sorting is a primitive operation that is a building block for countless
algorithms. As such, it is important to design sorting algorithms that approach
peak performance on a range of hardware architectures. Graphics Processing
Units (GPUs) are particularly attractive architectures as they provides massive
parallelism and computing power. However, the intricacies of their compute and
memory hierarchies make designing GPU-efficient algorithms challenging. In this
work we present GPU Multiway Mergesort (MMS), a new GPU-efficient multiway
mergesort algorithm. MMS employs a new partitioning technique that exposes the
parallelism needed by modern GPU architectures. To the best of our knowledge,
MMS is the first sorting algorithm for the GPU that is asymptotically optimal
in terms of global memory accesses and that is completely free of shared memory
bank conflicts.
We realize an initial implementation of MMS, evaluate its performance on
three modern GPU architectures, and compare it to competitive implementations
available in state-of-the-art GPU libraries. Despite these implementations
being highly optimized, MMS compares favorably, achieving performance
improvements for most random inputs. Furthermore, unlike MMS, state-of-the-art
algorithms are susceptible to bank conflicts. We find that for certain inputs
that cause these algorithms to incur large numbers of bank conflicts, MMS can
achieve up to a 37.6% speedup over its fastest competitor. Overall, even though
its current implementation is not fully optimized, due to its efficient use of
the memory hierarchy, MMS outperforms the fastest comparison-based sorting
implementations available to date
- …