scispace - formally typeset
Topic

Synchronization (computer science)

About: Synchronization (computer science) is a(n) research topic. Over the lifetime, 43303 publication(s) have been published within this topic receiving 559005 citation(s).

...read more

Papers
More filters

Proceedings ArticleDOI
25 Oct 2008-
TL;DR: This paper presents and characterizes the Princeton Application Repository for Shared-Memory Computers (PARSEC), a benchmark suite for studies of Chip-Multiprocessors (CMPs), and shows that the benchmark suite covers a wide spectrum of working sets, locality, data sharing, synchronization and off-chip traffic.

...read more

Abstract: This paper presents and characterizes the Princeton Application Repository for Shared-Memory Computers (PARSEC), a benchmark suite for studies of Chip-Multiprocessors (CMPs). Previous available benchmarks for multiprocessors have focused on high-performance computing applications and used a limited number of synchronization methods. PARSEC includes emerging applications in recognition, mining and synthesis (RMS) as well as systems applications which mimic large-scale multithreaded commercial programs. Our characterization shows that the benchmark suite covers a wide spectrum of working sets, locality, data sharing, synchronization and off-chip traffic. The benchmark suite has been made available to the public.

...read more

3,270 citations


Journal ArticleDOI
Abstract: Synchronization phenomena in large populations of interacting elements are the subject of intense research efforts in physical, biological, chemical, and social systems. A successful approach to the problem of synchronization consists of modeling each member of the population as a phase oscillator. In this review, synchronization is analyzed in one of the most representative models of coupled phase oscillators, the Kuramoto model. A rigorous mathematical treatment, specific numerical methods, and many variations and extensions of the original model that have appeared in the last few years are presented. Relevant applications of the model in different contexts are also included.

...read more

2,463 citations


20


Book ChapterDOI
Edmund M. Clarke1, E. Allen Emerson1Institutions (1)
01 May 1981-
TL;DR: It is shown that it is possible to automatically synthesize the synchronization skeleton of a concurrent program from a Temporal Logic specification and it is believed that this approach may in the long run turn out to be quite practical.

...read more

Abstract: We have shown that it is possible to automatically synthesize the synchronization skeleton of a concurrent program from a Temporal Logic specification We believe that this approach may in the long run turn out to be quite practical Since synchronization skeletons are, in general, quite small, the potentially exponential behavior of our algorithm need not be an insurmountable obstacle Much additional research will be needed, however, to make the approach feasible in practice

...read more

2,262 citations


Journal ArticleDOI
01 Aug 2002-Physics Reports
Abstract: Synchronization of chaos refers to a process wherein two (or many) chaotic systems (either equivalent or nonequivalent) adjust a given property of their motion to a common behavior due to a coupling or to a forcing (periodical or noisy). We review major ideas involved in the field of synchronization of chaotic systems, and present in detail several types of synchronization features: complete synchronization, lag synchronization, generalized synchronization, phase and imperfect phase synchronization. We also discuss problems connected with characterizing synchronized states in extended pattern forming systems. Finally, we point out the relevance of chaos synchronization, especially in physiology, nonlinear optics and fluid dynamics, and give a review of relevant experimental applications of these ideas and techniques.

...read more

2,102 citations


Proceedings Article
12 Dec 2011-
Abstract: Stochastic Gradient Descent (SGD) is a popular algorithm that can achieve state-of-the-art performance on a variety of machine learning tasks. Several researchers have recently proposed schemes to parallelize SGD, but all require performance-destroying memory locking and synchronization. This work aims to show using novel theoretical analysis, algorithms, and implementation that SGD can be implemented without any locking. We present an update scheme called HOGWILD! which allows processors access to shared memory with the possibility of overwriting each other's work. We show that when the associated optimization problem is sparse, meaning most gradient updates only modify small parts of the decision variable, then HOGWILD! achieves a nearly optimal rate of convergence. We demonstrate experimentally that HOGWILD! outperforms alternative schemes that use locking by an order of magnitude.

...read more

1,807 citations


Network Information
Related Topics (5)
Communications protocol

19.1K papers, 349.6K citations

85% related
Real time Java

5.4K papers, 124.5K citations

82% related
Distributed algorithm

20.4K papers, 548.1K citations

82% related
Server

79.5K papers, 1.4M citations

82% related
Network management station

12.1K papers, 243.1K citations

82% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202253
20211,823
20202,223
20192,643
20182,629
20172,539

Top Attributes

Show by:

Topic's top 5 most impactful authors

Jinde Cao

208 papers, 8.9K citations

Ju H. Park

88 papers, 4.1K citations

Tingwen Huang

65 papers, 2.5K citations

Haijun Jiang

58 papers, 1.4K citations

Guanrong Chen

50 papers, 2.9K citations