1,288 research outputs found
Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures
In this paper, we perform an empirical evaluation of the Parallel External
Memory (PEM) model in the context of geometric problems. In particular, we
implement the parallel distribution sweeping framework of Ajwani, Sitchinava
and Zeh to solve batched 1-dimensional stabbing max problem. While modern
processors consist of sophisticated memory systems (multiple levels of caches,
set associativity, TLB, prefetching), we empirically show that algorithms
designed in simple models, that focus on minimizing the I/O transfers between
shared memory and single level cache, can lead to efficient software on current
multicore architectures. Our implementation exhibits significantly fewer
accesses to slow DRAM and, therefore, outperforms traditional approaches based
on plane sweep and two-way divide and conquer.Comment: Longer version of ESA'13 pape
Approximating the {Nash} Social Welfare with Budget-Additive Valuations
We present the first constant-factor approximation algorithm for maximizing the Nash social welfare when allocating indivisible items to agents with budget-additive valuation functions. Budget-additive valuations represent an important class of submodular functions. They have attracted a lot of research interest in recent years due to many interesting applications. For every , our algorithm obtains a -approximation in time polynomial in the input size and . Our algorithm relies on rounding an approximate equilibrium in a linear Fisher market where sellers have earning limits (upper bounds on the amount of money they want to earn) and buyers have utility limits (upper bounds on the amount of utility they want to achieve). In contrast to markets with either earning or utility limits, these markets have not been studied before. They turn out to have fundamentally different properties. Although the existence of equilibria is not guaranteed, we show that the market instances arising from the Nash social welfare problem always have an equilibrium. Further, we show that the set of equilibria is not convex, answering a question of [Cole et al, EC 2017]. We design an FPTAS to compute an approximate equilibrium, a result that may be of independent interest
Parallel String Sample Sort
We discuss how string sorting algorithms can be parallelized on modern
multi-core shared memory machines. As a synthesis of the best sequential string
sorting algorithms and successful parallel sorting algorithms for atomic
objects, we propose string sample sort. The algorithm makes effective use of
the memory hierarchy, uses additional word level parallelism, and largely
avoids branch mispredictions. Additionally, we parallelize variants of multikey
quicksort and radix sort that are also useful in certain situations.Comment: 34 pages, 7 figures and 12 table
EFX exists for three agents
We study the problem of distributing a set of indivisible items among agents with additive valuations in a manner. The fairness notion under consideration is Envy-freeness up to any item (EFX). Despite significant efforts by many researchers for several years, the existence of EFX allocations has not been settled beyond the simple case of two agents. In this paper, we show constructively that an EFX allocation always exists for three agents. Furthermore, we falsify the conjecture by Caragiannis et al. by showing an instance with three agents for which there is a partial EFX allocation (some items are not allocated) with higher Nash welfare than that of any complete EFX allocation
Critical behavior of the Random-Field Ising Magnet with long range correlated disorder
We study the correlated-disorder driven zero-temperature phase transition of
the Random-Field Ising Magnet using exact numerical ground-state calculations
for cubic lattices. We consider correlations of the quenched disorder decaying
proportional to r^a, where r is the distance between two lattice sites and a<0.
To obtain exact ground states, we use a well established mapping to the
graph-theoretical maximum-flow problem, which allows us to study large system
sizes of more than two million spins. We use finite-size scaling analyses for
values a={-1,-2,-3,-7} to calculate the critical point and the critical
exponents characterizing the behavior of the specific heat, magnetization,
susceptibility and of the correlation length close to the critical point. We
find basically the same critical behavior as for the RFIM with delta-correlated
disorder, except for the finite-size exponent of the susceptibility and for the
case a=-1, where the results are also compatible with a phase transition at
infinitesimal disorder strength.
A summary of this work can be found at the papercore database at
www.papercore.org.Comment: 9 pages, 13 figure
Local investigation of femtosecond laser induced dynamics of water nanoclusters on Cu(111)
We explore the dynamics of low temperature interfacial water nanoclusters on Cu(111) by femtosecond-laser excitation, scanning tunneling microscopy and density functional theory. Laser illumination can be used to induce single molecules to diffuse within water clusters and across the surface, breaking and reforming hydrogen bonds. A linear diffusion probability with laser fluence is observed up to 0.6 J/m2 and we suggest that diffusion is initiated by hot electron attachment and detachment processes. The density functional calculations shed light on the detailed molecular mechanism for water diffusion that is determined by the local structure of the water clusters
Maximum weight cycle packing in directed graphs, with application to kidney exchange programs
Centralized matching programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually, the goal is to maximize the number of transplants, but sometimes the total benefit is maximized by considering the differences between suitable kidneys. These problems correspond to computing cycle packings of maximum size or maximum weight in directed graphs. Here we prove the APX-completeness of the problem of finding a maximum size exchange involving only 2-cycles and 3-cycles. We also present an approximation algorithm and an exact algorithm for the problem of finding a maximum weight exchange involving cycles of bounded length. The exact algorithm has been used to provide optimal solutions to real kidney exchange problems arising from the National Matching Scheme for Paired Donation run by NHS Blood and Transplant, and we describe practical experience based on this collaboration
- âŚ