---
_id: '5962'
abstract:
- lang: eng
text: Stochastic Gradient Descent (SGD) is a fundamental algorithm in machine learning,
representing the optimization backbone for training several classic models, from
regression to neural networks. Given the recent practical focus on distributed
machine learning, significant work has been dedicated to the convergence properties
of this algorithm under the inconsistent and noisy updates arising from execution
in a distributed environment. However, surprisingly, the convergence properties
of this classic algorithm in the standard shared-memory model are still not well-understood.
In this work, we address this gap, and provide new convergence bounds for lock-free
concurrent stochastic gradient descent, executing in the classic asynchronous
shared memory model, against a strong adaptive adversary. Our results give improved
upper and lower bounds on the "price of asynchrony'' when executing the fundamental
SGD algorithm in a concurrent setting. They show that this classic optimization
tool can converge faster and with a wider range of parameters than previously
known under asynchronous iterations. At the same time, we exhibit a fundamental
trade-off between the maximum delay in the system and the rate at which SGD can
converge, which governs the set of parameters under which this algorithm can still
work efficiently.
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Christopher
full_name: De Sa, Christopher
last_name: De Sa
- first_name: Nikola H
full_name: Konstantinov, Nikola H
id: 4B9D76E4-F248-11E8-B48F-1D18A9856A87
last_name: Konstantinov
citation:
ama: 'Alistarh D-A, De Sa C, Konstantinov NH. The convergence of stochastic gradient
descent in asynchronous shared memory. In: Proceedings of the 2018 ACM Symposium
on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:169-178.
doi:10.1145/3212734.3212763'
apa: 'Alistarh, D.-A., De Sa, C., & Konstantinov, N. H. (2018). The convergence
of stochastic gradient descent in asynchronous shared memory. In Proceedings
of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18
(pp. 169–178). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212763'
chicago: Alistarh, Dan-Adrian, Christopher De Sa, and Nikola H Konstantinov. “The
Convergence of Stochastic Gradient Descent in Asynchronous Shared Memory.” In
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
- PODC ’18, 169–78. ACM Press, 2018. https://doi.org/10.1145/3212734.3212763.
ieee: D.-A. Alistarh, C. De Sa, and N. H. Konstantinov, “The convergence of stochastic
gradient descent in asynchronous shared memory,” in Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United
Kingdom, 2018, pp. 169–178.
ista: 'Alistarh D-A, De Sa C, Konstantinov NH. 2018. The convergence of stochastic
gradient descent in asynchronous shared memory. Proceedings of the 2018 ACM Symposium
on Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed
Computing, 169–178.'
mla: Alistarh, Dan-Adrian, et al. “The Convergence of Stochastic Gradient Descent
in Asynchronous Shared Memory.” Proceedings of the 2018 ACM Symposium on Principles
of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 169–78, doi:10.1145/3212734.3212763.
short: D.-A. Alistarh, C. De Sa, N.H. Konstantinov, in:, Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018,
pp. 169–178.
conference:
end_date: 2018-07-27
location: Egham, United Kingdom
name: 'PODC: Principles of Distributed Computing'
start_date: 2018-07-23
date_created: 2019-02-13T09:58:58Z
date_published: 2018-07-23T00:00:00Z
date_updated: 2023-09-19T10:42:53Z
day: '23'
department:
- _id: DaAl
doi: 10.1145/3212734.3212763
external_id:
arxiv:
- '1803.08841'
isi:
- '000458186900022'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1803.08841
month: '07'
oa: 1
oa_version: Preprint
page: 169-178
publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing -
PODC '18
publication_identifier:
isbn:
- '9781450357951'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The convergence of stochastic gradient descent in asynchronous shared memory
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5860'
abstract:
- lang: eng
text: 'A major problem for evolutionary theory is understanding the so-called open-ended
nature of evolutionary change, from its definition to its origins. Open-ended
evolution (OEE) refers to the unbounded increase in complexity that seems to characterize
evolution on multiple scales. This property seems to be a characteristic feature
of biological and technological evolution and is strongly tied to the generative
potential associated with combinatorics, which allows the system to grow and expand
their available state spaces. Interestingly, many complex systems presumably displaying
OEE, from language to proteins, share a common statistical property: the presence
of Zipf''s Law. Given an inventory of basic items (such as words or protein domains)
required to build more complex structures (sentences or proteins) Zipf''s Law
tells us that most of these elements are rare whereas a few of them are extremely
common. Using algorithmic information theory, in this paper we provide a fundamental
definition for open-endedness, which can be understood as postulates. Its statistical
counterpart, based on standard Shannon information theory, has the structure of
a variational problem which is shown to lead to Zipf''s Law as the expected consequence
of an evolutionary process displaying OEE. We further explore the problem of information
conservation through an OEE process and we conclude that statistical information
(standard Shannon information) is not conserved, resulting in the paradoxical
situation in which the increase of information content has the effect of erasing
itself. We prove that this paradox is solved if we consider non-statistical forms
of information. This last result implies that standard information theory may
not be a suitable theoretical framework to explore the persistence and increase
of the information content in OEE systems.'
article_number: '20180395'
article_processing_charge: No
author:
- first_name: Bernat
full_name: Corominas-Murtra, Bernat
id: 43BE2298-F248-11E8-B48F-1D18A9856A87
last_name: Corominas-Murtra
orcid: 0000-0001-9806-5643
- first_name: Luís F.
full_name: Seoane, Luís F.
last_name: Seoane
- first_name: Ricard
full_name: Solé, Ricard
last_name: Solé
citation:
ama: Corominas-Murtra B, Seoane LF, Solé R. Zipf’s Law, unbounded complexity and
open-ended evolution. Journal of the Royal Society Interface. 2018;15(149).
doi:10.1098/rsif.2018.0395
apa: Corominas-Murtra, B., Seoane, L. F., & Solé, R. (2018). Zipf’s Law, unbounded
complexity and open-ended evolution. Journal of the Royal Society Interface.
Royal Society Publishing. https://doi.org/10.1098/rsif.2018.0395
chicago: Corominas-Murtra, Bernat, Luís F. Seoane, and Ricard Solé. “Zipf’s Law,
Unbounded Complexity and Open-Ended Evolution.” Journal of the Royal Society
Interface. Royal Society Publishing, 2018. https://doi.org/10.1098/rsif.2018.0395.
ieee: B. Corominas-Murtra, L. F. Seoane, and R. Solé, “Zipf’s Law, unbounded complexity
and open-ended evolution,” Journal of the Royal Society Interface, vol.
15, no. 149. Royal Society Publishing, 2018.
ista: Corominas-Murtra B, Seoane LF, Solé R. 2018. Zipf’s Law, unbounded complexity
and open-ended evolution. Journal of the Royal Society Interface. 15(149), 20180395.
mla: Corominas-Murtra, Bernat, et al. “Zipf’s Law, Unbounded Complexity and Open-Ended
Evolution.” Journal of the Royal Society Interface, vol. 15, no. 149, 20180395,
Royal Society Publishing, 2018, doi:10.1098/rsif.2018.0395.
short: B. Corominas-Murtra, L.F. Seoane, R. Solé, Journal of the Royal Society Interface
15 (2018).
date_created: 2019-01-20T22:59:19Z
date_published: 2018-12-12T00:00:00Z
date_updated: 2023-09-19T10:40:38Z
day: '12'
department:
- _id: EdHa
doi: 10.1098/rsif.2018.0395
external_id:
arxiv:
- '1612.01605'
isi:
- '000456783800002'
intvolume: ' 15'
isi: 1
issue: '149'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1612.01605
month: '12'
oa: 1
oa_version: Preprint
publication: Journal of the Royal Society Interface
publication_identifier:
issn:
- '17425689'
publication_status: published
publisher: Royal Society Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Zipf's Law, unbounded complexity and open-ended evolution
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 15
year: '2018'
...
---
_id: '5960'
abstract:
- lang: eng
text: In this paper we present a reliable method to verify the existence of loops
along the uncertain trajectory of a robot, based on proprioceptive measurements
only, within a bounded-error context. The loop closure detection is one of the
key points in simultaneous localization and mapping (SLAM) methods, especially
in homogeneous environments with difficult scenes recognitions. The proposed approach
is generic and could be coupled with conventional SLAM algorithms to reliably
reduce their computing burden, thus improving the localization and mapping processes
in the most challenging environments such as unexplored underwater extents. To
prove that a robot performed a loop whatever the uncertainties in its evolution,
we employ the notion of topological degree that originates in the field of differential
topology. We show that a verification tool based on the topological degree is
an optimal method for proving robot loops. This is demonstrated both on datasets
from real missions involving autonomous underwater vehicles and by a mathematical
discussion.
article_processing_charge: No
author:
- first_name: Simon
full_name: Rohou, Simon
last_name: Rohou
- first_name: Peter
full_name: Franek, Peter
id: 473294AE-F248-11E8-B48F-1D18A9856A87
last_name: Franek
orcid: 0000-0001-8878-8397
- first_name: Clément
full_name: Aubry, Clément
last_name: Aubry
- first_name: Luc
full_name: Jaulin, Luc
last_name: Jaulin
citation:
ama: Rohou S, Franek P, Aubry C, Jaulin L. Proving the existence of loops in robot
trajectories. The International Journal of Robotics Research. 2018;37(12):1500-1516.
doi:10.1177/0278364918808367
apa: Rohou, S., Franek, P., Aubry, C., & Jaulin, L. (2018). Proving the existence
of loops in robot trajectories. The International Journal of Robotics Research.
SAGE Publications. https://doi.org/10.1177/0278364918808367
chicago: Rohou, Simon, Peter Franek, Clément Aubry, and Luc Jaulin. “Proving the
Existence of Loops in Robot Trajectories.” The International Journal of Robotics
Research. SAGE Publications, 2018. https://doi.org/10.1177/0278364918808367.
ieee: S. Rohou, P. Franek, C. Aubry, and L. Jaulin, “Proving the existence of loops
in robot trajectories,” The International Journal of Robotics Research,
vol. 37, no. 12. SAGE Publications, pp. 1500–1516, 2018.
ista: Rohou S, Franek P, Aubry C, Jaulin L. 2018. Proving the existence of loops
in robot trajectories. The International Journal of Robotics Research. 37(12),
1500–1516.
mla: Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.”
The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications,
2018, pp. 1500–16, doi:10.1177/0278364918808367.
short: S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics
Research 37 (2018) 1500–1516.
date_created: 2019-02-13T09:36:20Z
date_published: 2018-10-24T00:00:00Z
date_updated: 2023-09-19T10:41:59Z
day: '24'
department:
- _id: UlWa
doi: 10.1177/0278364918808367
external_id:
arxiv:
- '1712.01341'
isi:
- '000456881100004'
intvolume: ' 37'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1712.01341
month: '10'
oa: 1
oa_version: Preprint
page: 1500-1516
publication: The International Journal of Robotics Research
publication_identifier:
eissn:
- 1741-3176
issn:
- 0278-3649
publication_status: published
publisher: SAGE Publications
quality_controlled: '1'
scopus_import: '1'
status: public
title: Proving the existence of loops in robot trajectories
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 37
year: '2018'
...
---
_id: '5963'
abstract:
- lang: eng
text: 'There has been significant progress in understanding the parallelism inherent
to iterative sequential algorithms: for many classic algorithms, the depth of
the dependence structure is now well understood, and scheduling techniques have
been developed to exploit this shallow dependence structure for efficient parallel
implementations. A related, applied research strand has studied methods by which
certain iterative task-based algorithms can be efficiently parallelized via relaxed
concurrent priority schedulers. These allow for high concurrency when inserting
and removing tasks, at the cost of executing superfluous work due to the relaxed
semantics of the scheduler. In this work, we take a step towards unifying these
two research directions, by showing that there exists a family of relaxed priority
schedulers that can efficiently and deterministically execute classic iterative
algorithms such as greedy maximal independent set (MIS) and matching. Our primary
result shows that, given a randomized scheduler with an expected relaxation factor
of k in terms of the maximum allowed priority inversions on a task, and any graph
on n vertices, the scheduler is able to execute greedy MIS with only an additive
factor of \poly(k) expected additional iterations compared to an exact (but not
scalable) scheduler. This counter-intuitive result demonstrates that the overhead
of relaxation when computing MIS is not dependent on the input size or structure
of the input graph. Experimental results show that this overhead can be clearly
offset by the gain in performance due to the highly scalable scheduler. In sum,
we present an efficient method to deterministically parallelize iterative sequential
algorithms, with provable runtime guarantees in terms of the number of executed
tasks to completion.'
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Giorgi
full_name: Nadiradze, Giorgi
last_name: Nadiradze
citation:
ama: 'Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. Relaxed schedulers can efficiently
parallelize iterative algorithms. In: Proceedings of the 2018 ACM Symposium
on Principles of Distributed Computing - PODC ’18. ACM Press; 2018:377-386.
doi:10.1145/3212734.3212756'
apa: 'Alistarh, D.-A., Brown, T. A., Kopinsky, J., & Nadiradze, G. (2018). Relaxed
schedulers can efficiently parallelize iterative algorithms. In Proceedings
of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18
(pp. 377–386). Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212756'
chicago: Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, and Giorgi Nadiradze.
“Relaxed Schedulers Can Efficiently Parallelize Iterative Algorithms.” In Proceedings
of the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18,
377–86. ACM Press, 2018. https://doi.org/10.1145/3212734.3212756.
ieee: D.-A. Alistarh, T. A. Brown, J. Kopinsky, and G. Nadiradze, “Relaxed schedulers
can efficiently parallelize iterative algorithms,” in Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18, Egham, United
Kingdom, 2018, pp. 377–386.
ista: 'Alistarh D-A, Brown TA, Kopinsky J, Nadiradze G. 2018. Relaxed schedulers
can efficiently parallelize iterative algorithms. Proceedings of the 2018 ACM
Symposium on Principles of Distributed Computing - PODC ’18. PODC: Principles
of Distributed Computing, 377–386.'
mla: Alistarh, Dan-Adrian, et al. “Relaxed Schedulers Can Efficiently Parallelize
Iterative Algorithms.” Proceedings of the 2018 ACM Symposium on Principles
of Distributed Computing - PODC ’18, ACM Press, 2018, pp. 377–86, doi:10.1145/3212734.3212756.
short: D.-A. Alistarh, T.A. Brown, J. Kopinsky, G. Nadiradze, in:, Proceedings of
the 2018 ACM Symposium on Principles of Distributed Computing - PODC ’18, ACM
Press, 2018, pp. 377–386.
conference:
end_date: 2018-07-27
location: Egham, United Kingdom
name: 'PODC: Principles of Distributed Computing'
start_date: 2018-07-23
date_created: 2019-02-13T10:03:25Z
date_published: 2018-07-23T00:00:00Z
date_updated: 2023-09-19T10:43:21Z
day: '23'
department:
- _id: DaAl
doi: 10.1145/3212734.3212756
external_id:
arxiv:
- '1808.04155'
isi:
- '000458186900048'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1808.04155
month: '07'
oa: 1
oa_version: Preprint
page: 377-386
publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing -
PODC '18
publication_identifier:
isbn:
- '9781450357951'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Relaxed schedulers can efficiently parallelize iterative algorithms
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5965'
abstract:
- lang: eng
text: Relaxed concurrent data structures have become increasingly popular, due to
their scalability in graph processing and machine learning applications (\citeNguyen13,
gonzalez2012powergraph ). Despite considerable interest, there exist families
of natural, high performing randomized relaxed concurrent data structures, such
as the popular MultiQueue~\citeMQ pattern for implementing relaxed priority queue
data structures, for which no guarantees are known in the concurrent setting~\citeAKLN17.
Our main contribution is in showing for the first time that, under a set of analytic
assumptions, a family of relaxed concurrent data structures, including variants
of MultiQueues, but also a new approximate counting algorithm we call the MultiCounter,
provides strong probabilistic guarantees on the degree of relaxation with respect
to the sequential specification, in arbitrary concurrent executions. We formalize
these guarantees via a new correctness condition called distributional linearizability,
tailored to concurrent implementations with randomized relaxations. Our result
is based on a new analysis of an asynchronous variant of the classic power-of-two-choices
load balancing algorithm, in which placement choices can be based on inconsistent,
outdated information (this result may be of independent interest). We validate
our results empirically, showing that the MultiCounter algorithm can implement
scalable relaxed timestamps.
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Justin
full_name: Kopinsky, Justin
last_name: Kopinsky
- first_name: Jerry Z.
full_name: Li, Jerry Z.
last_name: Li
- first_name: Giorgi
full_name: Nadiradze, Giorgi
last_name: Nadiradze
citation:
ama: 'Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. Distributionally linearizable
data structures. In: Proceedings of the 30th on Symposium on Parallelism in
Algorithms and Architectures - SPAA ’18. ACM Press; 2018:133-142. doi:10.1145/3210377.3210411'
apa: 'Alistarh, D.-A., Brown, T. A., Kopinsky, J., Li, J. Z., & Nadiradze, G.
(2018). Distributionally linearizable data structures. In Proceedings of the
30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18
(pp. 133–142). Vienna, Austria: ACM Press. https://doi.org/10.1145/3210377.3210411'
chicago: Alistarh, Dan-Adrian, Trevor A Brown, Justin Kopinsky, Jerry Z. Li, and
Giorgi Nadiradze. “Distributionally Linearizable Data Structures.” In Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18, 133–42. ACM Press, 2018. https://doi.org/10.1145/3210377.3210411.
ieee: D.-A. Alistarh, T. A. Brown, J. Kopinsky, J. Z. Li, and G. Nadiradze, “Distributionally
linearizable data structures,” in Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 133–142.
ista: 'Alistarh D-A, Brown TA, Kopinsky J, Li JZ, Nadiradze G. 2018. Distributionally
linearizable data structures. Proceedings of the 30th on Symposium on Parallelism
in Algorithms and Architectures - SPAA ’18. SPAA: Symposium on Parallelism in
Algorithms and Architectures, 133–142.'
mla: Alistarh, Dan-Adrian, et al. “Distributionally Linearizable Data Structures.”
Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
- SPAA ’18, ACM Press, 2018, pp. 133–42, doi:10.1145/3210377.3210411.
short: D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18, ACM Press, 2018, pp. 133–142.
conference:
end_date: 2018-07-18
location: Vienna, Austria
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2018-07-16
date_created: 2019-02-13T10:17:19Z
date_published: 2018-07-16T00:00:00Z
date_updated: 2023-09-19T10:44:13Z
day: '16'
department:
- _id: DaAl
doi: 10.1145/3210377.3210411
external_id:
arxiv:
- '1804.01018'
isi:
- '000545269600016'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.01018
month: '07'
oa: 1
oa_version: Preprint
page: 133-142
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA '18
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
related_material:
record:
- id: '10429'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Distributionally linearizable data structures
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5967'
abstract:
- lang: eng
text: "The Big Match is a multi-stage two-player game. In each stage Player 1 hides
one or two pebbles in his hand, and his opponent has to guess that number; Player
1 loses a point if Player 2 is correct, and otherwise he wins a point. As soon
as Player 1 hides one pebble, the players cannot change their choices in any future
stage.\r\nBlackwell and Ferguson (1968) give an ε-optimal strategy for Player
1 that hides, in each stage, one pebble with a probability that depends on the
entire past history. Any strategy that depends just on the clock or on a finite
memory is worthless. The long-standing natural open problem has been whether every
strategy that depends just on the clock and a finite memory is worthless. We prove
that there is such a strategy that is ε-optimal. In fact, we show that just two
states of memory are sufficient.\r\n"
article_processing_charge: No
author:
- first_name: Kristoffer Arnsfelt
full_name: Hansen, Kristoffer Arnsfelt
last_name: Hansen
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Abraham
full_name: Neyman, Abraham
last_name: Neyman
citation:
ama: 'Hansen KA, Ibsen-Jensen R, Neyman A. The Big Match with a clock and a bit
of memory. In: Proceedings of the 2018 ACM Conference on Economics and Computation
- EC ’18. ACM Press; 2018:149-150. doi:10.1145/3219166.3219198'
apa: 'Hansen, K. A., Ibsen-Jensen, R., & Neyman, A. (2018). The Big Match with
a clock and a bit of memory. In Proceedings of the 2018 ACM Conference on Economics
and Computation - EC ’18 (pp. 149–150). Ithaca, NY, United States: ACM Press.
https://doi.org/10.1145/3219166.3219198'
chicago: Hansen, Kristoffer Arnsfelt, Rasmus Ibsen-Jensen, and Abraham Neyman. “The
Big Match with a Clock and a Bit of Memory.” In Proceedings of the 2018 ACM
Conference on Economics and Computation - EC ’18, 149–50. ACM Press, 2018.
https://doi.org/10.1145/3219166.3219198.
ieee: K. A. Hansen, R. Ibsen-Jensen, and A. Neyman, “The Big Match with a clock
and a bit of memory,” in Proceedings of the 2018 ACM Conference on Economics
and Computation - EC ’18, Ithaca, NY, United States, 2018, pp. 149–150.
ista: 'Hansen KA, Ibsen-Jensen R, Neyman A. 2018. The Big Match with a clock and
a bit of memory. Proceedings of the 2018 ACM Conference on Economics and Computation
- EC ’18. EC: Conference on Economics and Computation, 149–150.'
mla: Hansen, Kristoffer Arnsfelt, et al. “The Big Match with a Clock and a Bit of
Memory.” Proceedings of the 2018 ACM Conference on Economics and Computation
- EC ’18, ACM Press, 2018, pp. 149–50, doi:10.1145/3219166.3219198.
short: K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM
Conference on Economics and Computation - EC ’18, ACM Press, 2018, pp. 149–150.
conference:
end_date: 2018-06-22
location: Ithaca, NY, United States
name: 'EC: Conference on Economics and Computation'
start_date: 2018-06-18
date_created: 2019-02-13T10:31:41Z
date_published: 2018-06-18T00:00:00Z
date_updated: 2023-09-19T10:45:15Z
day: '18'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1145/3219166.3219198
external_id:
isi:
- '000492755100020'
file:
- access_level: open_access
checksum: bb52683e349cfd864f4769a8f38f2798
content_type: application/pdf
creator: dernst
date_created: 2019-11-19T08:24:24Z
date_updated: 2020-07-14T12:47:14Z
file_id: '7054'
file_name: 2018_EC18_Hansen.pdf
file_size: 302539
relation: main_file
file_date_updated: 2020-07-14T12:47:14Z
has_accepted_license: '1'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Submitted Version
page: 149-150
publication: Proceedings of the 2018 ACM Conference on Economics and Computation -
EC '18
publication_identifier:
isbn:
- '9781450358293'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The Big Match with a clock and a bit of memory
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5966'
abstract:
- lang: eng
text: 'The transactional conflict problem arises in transactional systems whenever
two or more concurrent transactions clash on a data item. While the standard solution
to such conflicts is to immediately abort one of the transactions, some practical
systems consider the alternative of delaying conflict resolution for a short interval,
which may allow one of the transactions to commit. The challenge in the transactional
conflict problem is to choose the optimal length of this delay interval so as
to minimize the overall running time penalty for the conflicting transactions.
In this paper, we propose a family of optimal online algorithms for the transactional
conflict problem. Specifically, we consider variants of this problem which arise
in different implementations of transactional systems, namely "requestor wins''''
and "requestor aborts'''' implementations: in the former, the recipient of a coherence
request is aborted, whereas in the latter, it is the requestor which has to abort.
Both strategies are implemented by real systems. We show that the requestor aborts
case can be reduced to a classic instance of the ski rental problem, while the
requestor wins case leads to a new version of this classical problem, for which
we derive optimal deterministic and randomized algorithms. Moreover, we prove
that, under a simplified adversarial model, our algorithms are constant-competitive
with the offline optimum in terms of throughput. We validate our algorithmic results
empirically through a hardware simulation of hardware transactional memory (HTM),
showing that our algorithms can lead to non-trivial performance improvements for
classic concurrent data structures.'
article_processing_charge: No
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Syed Kamran
full_name: Haider, Syed Kamran
last_name: Haider
- first_name: Raphael
full_name: Kübler, Raphael
last_name: Kübler
- first_name: Giorgi
full_name: Nadiradze, Giorgi
last_name: Nadiradze
citation:
ama: 'Alistarh D-A, Haider SK, Kübler R, Nadiradze G. The transactional conflict
problem. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms
and Architectures - SPAA ’18. ACM Press; 2018:383-392. doi:10.1145/3210377.3210406'
apa: 'Alistarh, D.-A., Haider, S. K., Kübler, R., & Nadiradze, G. (2018). The
transactional conflict problem. In Proceedings of the 30th on Symposium on
Parallelism in Algorithms and Architectures - SPAA ’18 (pp. 383–392). Vienna,
Austria: ACM Press. https://doi.org/10.1145/3210377.3210406'
chicago: Alistarh, Dan-Adrian, Syed Kamran Haider, Raphael Kübler, and Giorgi Nadiradze.
“The Transactional Conflict Problem.” In Proceedings of the 30th on Symposium
on Parallelism in Algorithms and Architectures - SPAA ’18, 383–92. ACM Press,
2018. https://doi.org/10.1145/3210377.3210406.
ieee: D.-A. Alistarh, S. K. Haider, R. Kübler, and G. Nadiradze, “The transactional
conflict problem,” in Proceedings of the 30th on Symposium on Parallelism in
Algorithms and Architectures - SPAA ’18, Vienna, Austria, 2018, pp. 383–392.
ista: 'Alistarh D-A, Haider SK, Kübler R, Nadiradze G. 2018. The transactional conflict
problem. Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA ’18. SPAA: Symposium on Parallelism in Algorithms and Architectures,
383–392.'
mla: Alistarh, Dan-Adrian, et al. “The Transactional Conflict Problem.” Proceedings
of the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA
’18, ACM Press, 2018, pp. 383–92, doi:10.1145/3210377.3210406.
short: D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of
the 30th on Symposium on Parallelism in Algorithms and Architectures - SPAA ’18,
ACM Press, 2018, pp. 383–392.
conference:
end_date: 2018-07-18
location: Vienna, Austria
name: 'SPAA: Symposium on Parallelism in Algorithms and Architectures'
start_date: 2018-07-16
date_created: 2019-02-13T10:26:07Z
date_published: 2018-07-16T00:00:00Z
date_updated: 2023-09-19T10:44:49Z
day: '16'
department:
- _id: DaAl
doi: 10.1145/3210377.3210406
external_id:
arxiv:
- '1804.00947'
isi:
- '000545269600046'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1804.00947
month: '07'
oa: 1
oa_version: Preprint
page: 383-392
publication: Proceedings of the 30th on Symposium on Parallelism in Algorithms and
Architectures - SPAA '18
publication_identifier:
isbn:
- '9781450357999'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The transactional conflict problem
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5975'
abstract:
- lang: eng
text: We consider the recent formulation of the algorithmic Lov ́asz Local Lemma [N.
Har-vey and J. Vondr ́ak, inProceedings of FOCS, 2015, pp. 1327–1345; D. Achlioptas
and F. Iliopoulos,inProceedings of SODA, 2016, pp. 2024–2038; D. Achlioptas, F.
Iliopoulos, and V. Kolmogorov,ALocal Lemma for Focused Stochastic Algorithms,
arXiv preprint, 2018] for finding objects that avoid“bad features,” or “flaws.” It extends the Moser–Tardos resampling algorithm [R. A. Moser andG.
Tardos,J. ACM, 57 (2010), 11] to more general discrete spaces. At each step the
method picks aflaw present in the current state and goes to a new state according
to some prespecified probabilitydistribution (which depends on the current state
and the selected flaw). However, the recent formu-lation is less flexible than
the Moser–Tardos method since it requires a specific flaw selection rule,whereas
the algorithm of Moser and Tardos allows an arbitrary rule (and thus can potentially
beimplemented more efficiently). We formulate a new “commutativity” condition
and prove that it issufficient for an arbitrary rule to work. It also enables
an efficient parallelization under an additionalassumption. We then show that
existing resampling oracles for perfect matchings and permutationsdo satisfy this
condition.
article_processing_charge: No
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM
Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306
apa: Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma.
SIAM Journal on Computing. Society for Industrial & Applied Mathematics
(SIAM). https://doi.org/10.1137/16m1093306
chicago: Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”
SIAM Journal on Computing. Society for Industrial & Applied Mathematics
(SIAM), 2018. https://doi.org/10.1137/16m1093306.
ieee: V. Kolmogorov, “Commutativity in the algorithmic Lovász local lemma,” SIAM
Journal on Computing, vol. 47, no. 6. Society for Industrial & Applied
Mathematics (SIAM), pp. 2029–2056, 2018.
ista: Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM
Journal on Computing. 47(6), 2029–2056.
mla: Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”
SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial &
Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
short: V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
date_created: 2019-02-13T12:59:33Z
date_published: 2018-11-08T00:00:00Z
date_updated: 2023-09-19T14:24:58Z
day: '08'
department:
- _id: VlKo
doi: 10.1137/16m1093306
ec_funded: 1
external_id:
arxiv:
- '1506.08547'
isi:
- '000453785100001'
intvolume: ' 47'
isi: 1
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1506.08547
month: '11'
oa: 1
oa_version: Preprint
page: 2029-2056
project:
- _id: 25FBA906-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '616160'
name: 'Discrete Optimization in Computer Vision: Theory and Practice'
publication: SIAM Journal on Computing
publication_identifier:
eissn:
- 1095-7111
issn:
- 0097-5397
publication_status: published
publisher: Society for Industrial & Applied Mathematics (SIAM)
quality_controlled: '1'
related_material:
record:
- id: '1193'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Commutativity in the algorithmic Lovász local lemma
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
volume: 47
year: '2018'
...
---
_id: '5964'
abstract:
- lang: eng
text: A standard design pattern found in many concurrent data structures, such as
hash tables or ordered containers, is an alternation of parallelizable sections
that incur no data conflicts and critical sections that must run sequentially
and are protected with locks. A lock can be viewed as a queue that arbitrates
the order in which the critical sections are executed, and a natural question
is whether we can use stochastic analysis to predict the resulting throughput.
As a preliminary evidence to the affirmative, we describe a simple model that
can be used to predict the throughput of coarse-grained lock-based algorithms.
We show that our model works well for CLH lock, and we expect it to work for other
popular lock designs such as TTAS, MCS, etc.
article_processing_charge: No
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Petr
full_name: Kuznetsov, Petr
last_name: Kuznetsov
citation:
ama: 'Aksenov V, Alistarh D-A, Kuznetsov P. Brief Announcement: Performance prediction
for coarse-grained locking. In: Proceedings of the 2018 ACM Symposium on Principles
of Distributed Computing - PODC ’18. ACM Press; 2018:411-413. doi:10.1145/3212734.3212785'
apa: 'Aksenov, V., Alistarh, D.-A., & Kuznetsov, P. (2018). Brief Announcement:
Performance prediction for coarse-grained locking. In Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18 (pp. 411–413).
Egham, United Kingdom: ACM Press. https://doi.org/10.1145/3212734.3212785'
chicago: 'Aksenov, Vitaly, Dan-Adrian Alistarh, and Petr Kuznetsov. “Brief Announcement:
Performance Prediction for Coarse-Grained Locking.” In Proceedings of the 2018
ACM Symposium on Principles of Distributed Computing - PODC ’18, 411–13.
ACM Press, 2018. https://doi.org/10.1145/3212734.3212785.'
ieee: 'V. Aksenov, D.-A. Alistarh, and P. Kuznetsov, “Brief Announcement: Performance
prediction for coarse-grained locking,” in Proceedings of the 2018 ACM Symposium
on Principles of Distributed Computing - PODC ’18, Egham, United Kingdom,
2018, pp. 411–413.'
ista: 'Aksenov V, Alistarh D-A, Kuznetsov P. 2018. Brief Announcement: Performance
prediction for coarse-grained locking. Proceedings of the 2018 ACM Symposium on
Principles of Distributed Computing - PODC ’18. PODC: Principles of Distributed
Computing, 411–413.'
mla: 'Aksenov, Vitaly, et al. “Brief Announcement: Performance Prediction for Coarse-Grained
Locking.” Proceedings of the 2018 ACM Symposium on Principles of Distributed
Computing - PODC ’18, ACM Press, 2018, pp. 411–13, doi:10.1145/3212734.3212785.'
short: V. Aksenov, D.-A. Alistarh, P. Kuznetsov, in:, Proceedings of the 2018 ACM
Symposium on Principles of Distributed Computing - PODC ’18, ACM Press, 2018,
pp. 411–413.
conference:
end_date: 2018-07-27
location: Egham, United Kingdom
name: 'PODC: Principles of Distributed Computing'
start_date: 2018-07-23
date_created: 2019-02-13T10:08:19Z
date_published: 2018-07-23T00:00:00Z
date_updated: 2023-09-19T10:43:45Z
day: '23'
department:
- _id: DaAl
doi: 10.1145/3212734.3212785
external_id:
isi:
- '000458186900052'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://hal-univ-lyon3.archives-ouvertes.fr/INRIA/hal-01887733v1
month: '07'
oa: 1
oa_version: Submitted Version
page: 411-413
publication: Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing -
PODC '18
publication_identifier:
isbn:
- '9781450357951'
publication_status: published
publisher: ACM Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief Announcement: Performance prediction for coarse-grained locking'
type: conference
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...
---
_id: '5971'
abstract:
- lang: eng
text: "We consider a Wigner-type ensemble, i.e. large hermitian N×N random matrices
H=H∗ with centered independent entries and with a general matrix of variances
Sxy=\U0001D53C∣∣Hxy∣∣2. The norm of H is asymptotically given by the maximum of
the support of the self-consistent density of states. We establish a bound on
this maximum in terms of norms of powers of S that substantially improves the
earlier bound 2∥S∥1/2∞ given in [O. Ajanki, L. Erdős and T. Krüger, Universality
for general Wigner-type matrices, Prob. Theor. Rel. Fields169 (2017) 667–727].
The key element of the proof is an effective Markov chain approximation for the
contributions of the weighted Dyck paths appearing in the iterative solution of
the corresponding Dyson equation."
article_number: '1950009'
article_processing_charge: No
author:
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Peter
full_name: Mühlbacher, Peter
last_name: Mühlbacher
citation:
ama: 'Erdös L, Mühlbacher P. Bounds on the norm of Wigner-type random matrices.
Random matrices: Theory and applications. 2018. doi:10.1142/s2010326319500096'
apa: 'Erdös, L., & Mühlbacher, P. (2018). Bounds on the norm of Wigner-type
random matrices. Random Matrices: Theory and Applications. World Scientific
Publishing. https://doi.org/10.1142/s2010326319500096'
chicago: 'Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type
Random Matrices.” Random Matrices: Theory and Applications. World Scientific
Publishing, 2018. https://doi.org/10.1142/s2010326319500096.'
ieee: 'L. Erdös and P. Mühlbacher, “Bounds on the norm of Wigner-type random matrices,”
Random matrices: Theory and applications. World Scientific Publishing,
2018.'
ista: 'Erdös L, Mühlbacher P. 2018. Bounds on the norm of Wigner-type random matrices.
Random matrices: Theory and applications., 1950009.'
mla: 'Erdös, László, and Peter Mühlbacher. “Bounds on the Norm of Wigner-Type Random
Matrices.” Random Matrices: Theory and Applications, 1950009, World Scientific
Publishing, 2018, doi:10.1142/s2010326319500096.'
short: 'L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).'
date_created: 2019-02-13T10:40:54Z
date_published: 2018-09-26T00:00:00Z
date_updated: 2023-09-19T14:24:05Z
day: '26'
department:
- _id: LaEr
doi: 10.1142/s2010326319500096
ec_funded: 1
external_id:
arxiv:
- '1802.05175'
isi:
- '000477677200002'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/1802.05175
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 258DCDE6-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '338804'
name: Random matrices, universality and disordered quantum systems
publication: 'Random matrices: Theory and applications'
publication_identifier:
eissn:
- 2010-3271
issn:
- 2010-3263
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bounds on the norm of Wigner-type random matrices
type: journal_article
user_id: c635000d-4b10-11ee-a964-aac5a93f6ac1
year: '2018'
...