Log in

Relevant bibliographies by topics / Blocking synchronization

Academic literature on the topic 'Blocking synchronization'

Author: Grafiati

Published: 10 December 2022

Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Blocking synchronization.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Blocking synchronization"

1

Nazaruk, Vladislav, and Pavel Rusakov. "Blocking and Non-Blocking Process Synchronization: Analysis of Implementation." Scientific Journal of Riga Technical University. Computer Sciences 44, no. 1 (January 1, 2011): 145–50. http://dx.doi.org/10.2478/v10143-011-0033-2.

Full text

Abstract:

Blocking and Non-Blocking Process Synchronization: Analysis of Implementation —In computer programs with multiple processes, inter-process communication is of high importance. One of its main aspects is process synchronization, which can be divided into two classes: blocking and non-blocking. Blocking synchronization is simpler and mostly used; however, non-blocking synchronization allows avoiding some negative effects. In this paper, there is discussed the logic of widespread process synchronization mechanisms and is analyzed the support of these mechanisms in different platforms.

APA, Harvard, Vancouver, ISO, and other styles

2

Yang, Mao Lin, Hang Lei, Yong Liao, and Lin Hui Hu. "Synchronization Analysis for Hard Real-Time Multicore Systems." Applied Mechanics and Materials 241-244 (December 2012): 2246–52. http://dx.doi.org/10.4028/www.scientific.net/amm.241-244.2246.

Full text

Abstract:

Multicore processors are increasingly used in real-time embedded systems. Better utilization of hard real-time systems requires accurate scheduling and synchronization analysis. In this paper, we characterize the major synchronization penalties arising from partitioned fixed priority scheduling for hard real-time tasks on multicore platform, including transitive remote preemption, multiple remote blocking, and multiple priority inversions. Subsequently, we propose a new response time analysis by improving the approach to bound task blocking time. The key idea of this approach is to classify the total blocking time into (i) direct blocking, including local and remote blocking, and transitive remote preemption; and (ii) multiple local interference which is incurred by multiple priority inversion. Simulation results indicate that the proposed approach produces less pessimistic results in task blocking time, and better schedulability performance.

APA, Harvard, Vancouver, ISO, and other styles

3

Wang, Shu-Ying, Jian-Feng Zhao, Xian-Feng Li, and Li-Tao Zhang. "Image Blocking Encryption Algorithm Based on Laser Chaos Synchronization." Journal of Electrical and Computer Engineering 2016 (2016): 1–14. http://dx.doi.org/10.1155/2016/4138654.

Full text

Abstract:

In view of the digital image transmission security, based on laser chaos synchronization and Arnold cat map, a novel image encryption scheme is proposed. Based on pixel values of plain image a parameter is generated to influence the secret key. Sequences of the drive system and response system are pretreated by the same method and make image blocking encryption scheme for plain image. Finally, pixels position are scrambled by general Arnold transformation. In decryption process, the chaotic synchronization accuracy is fully considered and the relationship between the effect of synchronization and decryption is analyzed, which has characteristics of high precision, higher efficiency, simplicity, flexibility, and better controllability. The experimental results show that the encryption algorithm image has high security and good antijamming performance.

APA, Harvard, Vancouver, ISO, and other styles

4

Kim, Changhui, Euteum Choi, Mingyun Han, Seongjin Lee, and Jaeho Kim. "Performance Analysis of RCU-Style Non-Blocking Synchronization Mechanisms on a Manycore-Based Operating System." Applied Sciences 12, no. 7 (March 29, 2022): 3458. http://dx.doi.org/10.3390/app12073458.

Full text

Abstract:

There have been recent advances in multi-core machines with tens and hundreds of cores, and there is an increasing emphasis on the software structure. Many different synchronization mechanism techniques have been developed to improve the performance and the scalability of manycore systems. As the non-blocking algorithms are promising in overcoming performance limits in traditional lock-based blocking synchronization mechanisms, we are observing an increased usage ratio and a number of non-blocking synchronization algorithms. For example, the usage ratio of RCU increased sharply in recent years. Since RCU exhibits low write performance and is difficult to use, the research community introduced RLU and MV-RLU synchronization algorithms to address the issues. RLU and MV-RLU, which are called RCU-style synchronization mechanisms, are promising in terms of providing easy-to-use APIs (Application Programming Interfaces) and better performance in manycore machines. To expand the applicability of RCU-style mechanisms, we need to measure the performance and analyze their measurements in various environments. To meet the goal, we evaluate them at the user and kernel level in sv6 variant, which is a research operating system on a manycore system. In order to enable RCU-style synchronization algorithms in sv6 variant, we implemented and modified some of the libraries and memory allocators in sv6 variant. We use micro-benchmarks that exploit a linked list and hash table to measure the performance while experimenting with parameters of the benchmarks and types of data structures. In most of the experiments, we observed that MV-RLU is scalable. MV-RLU exhibits about thirteen times better throughput than RCU in the case of running 70 threads. In addition, we compare the operation procedures and APIs of each RCU-style synchronization algorithm to analyze the pros and cons of the algorithms.

APA, Harvard, Vancouver, ISO, and other styles

5

Kumar, Ajitesh, and Sanjai Kumar Gupta. "Synchronization-Aware Task Allocation Techniques for Preemption Control to Reduce Blocking Time in Multiprocessor Real-Time System." International Journal of Embedded and Real-Time Communication Systems 11, no. 4 (October 2020): 60–79. http://dx.doi.org/10.4018/ijertcs.2020100104.

Full text

Abstract:

Multiprocessor real-time systems receive a great deal of attention. For better utilization of multiprocessors in a real-time context, an optimal approach for scheduling, allocation, and synchronization is required. In this research, a novel heuristic synchronization-aware scheduling has been proposed to reduce the blocking delays in a critical section and also bound to minimize multiple priority inversion. The key idea of this technique is to assign the task set in the same processor that accesses a common shared resource and also access them for the longest period of time; thereby, the global sharing of resource transforms into local sharing. From simulation results, it was concluded that the duration of blocking overheads should be minimized up to 25% to 30% and context switching between processors also reduced up to 10% to 15%. On the basis of result analysis, schedulability, minimization of context switching, and reduced blocking time indicate that the proposed method outperforms the existing methods and does not affect the task completion time.

APA, Harvard, Vancouver, ISO, and other styles

6

Greenwald, Michael, and David Cheriton. "The synergy between non-blocking synchronization and operating system structure." ACM SIGOPS Operating Systems Review 30, SI (October 28, 1996): 123–36. http://dx.doi.org/10.1145/248155.238767.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Yang, Maolin, Jian-Jia Chen, and Wen-Hung Huang. "A misconception in blocking time analyses under multiprocessor synchronization protocols." Real-Time Systems 53, no. 2 (December 7, 2016): 187–95. http://dx.doi.org/10.1007/s11241-016-9261-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Aziez, Sameir A., Nawar Al-Hemeary, Ahmed Hameed Reja, Tamás Zsedrovits, and György Cserey. "Using KNN Algorithm Predictor for Data Synchronization of Ultra-Tight GNSS/INS Integration." Electronics 10, no. 13 (June 23, 2021): 1513. http://dx.doi.org/10.3390/electronics10131513.

Full text

Abstract:

The INS system’s update rate is faster than that of the GNSS receiver. Additionally, GNSS receiver data may suffer from blocking for a few seconds for different reasons, affecting architecture integrations between GNSS and INS. This paper proposes a novel GNSS data prediction method using the k nearest neighbor (KNN) predictor algorithm to treat data synchronization between the INS sensors and GNSS receiver and overcome those GNSS receiver’s blocking, which may occur for a few seconds. The experimental work was conducted on a flying drone over a minor Hungarian (Mátyásföld, 47.4992 N, 19.1977 E) model airfield. The GNSS data are predicted by four different scenarios: the first is no blocking of data, and the other three have blocking periods of 1, 4, and 8 s, respectively. Ultra-tight architecture integration is used to perform the GNSS/INS integration to deal with the INS sensors’ inaccuracy and their divergence throughout the operation. The results show that using the GNSS/INS integration system yields better positioning data (in three axes (X, Y, and Z)) than using a stand-alone INS system or GNSS without a predictor.

APA, Harvard, Vancouver, ISO, and other styles

9

Lee, Eunji. "A Low Latency Non-blocking Skip List with Retrial-Free Synchronization." Journal of Computing Science and Engineering 13, no. 4 (December 31, 2019): 141–50. http://dx.doi.org/10.5626/jcse.2019.13.4.141.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Ruiz, Alejandro Perez, Mario Aldea Rivas, and Michael Gonzalez Harbour. "Non-Blocking Synchronization Between Real-Time and Non-Real-Time Applications." IEEE Access 8 (2020): 147618–34. http://dx.doi.org/10.1109/access.2020.3015385.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Blocking synchronization"

1

Cho, Hyeonjoong. "Utility Accrual Real-Time Scheduling and Synchronization on Single and Multiprocessors: Models, Algorithms, and Tradeoffs." Diss., [Blacksburg, Va. : University Libraries, Virginia Polytechnic Institute and State University, 2006. http://scholar.lib.vt.edu/theses/available/etd-09022006-160653.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Blocking synchronization"

1

Luginbühl, Martin, and Arvi Yli-Hankala. Assessment of the components of anaesthesia. Edited by Antony R. Wilkes and Jonathan G. Hardman. Oxford University Press, 2017. http://dx.doi.org/10.1093/med/9780199642045.003.0026.

Full text

Abstract:

In modern anaesthesia practice, hypnotic drugs, opioids, and neuromuscular blocking agents (NMBAs) are combined. The introduction of NMBAs in particular substantially increased the risk of awareness and recall during general anaesthesia. Hypnotic drugs such as propofol and volatile anaesthetics act through GABAA receptors and have typical effects on the electroencephalogram (EEG). During increasing concentrations of these pharmaceuticals, the EEG desynchronization is followed by gradual synchronization, slowing frequency, and increasing amplitude of EEG, thereafter EEG suppressions (burst suppression), and, finally, isoelectric EEG. Hypnotic depth monitors such as the Bispectral Index™, Entropy™, and Narcotrend® are based on quantitative EEG analysis and translate these changes into numbers between 100 and 0. Although they are good predictors of wakefulness and deep anaesthesia, their usefulness in prevention of awareness and recall has been challenged, especially when inhalation anaesthetics are used. External and patient-related artifacts such as epileptiform discharges and frontal electromyography (EMG) affect the signal so their readings need careful interpretation. Their use is recommended in patients at increased risk of awareness and recall and in patients under total intravenous anaesthesia. Monitors of analgesia and nociception are not established in clinical practice but mostly remain experimental although some are commercially available. Some use EEG changes induced by noxious stimulation (EEG arousal) or quantify the frontal EMG in relation to EEG, while others are based on the sympathoadrenergic stress response. Various other devices are also discussed in this chapter.

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Blocking synchronization"

1

Blieberger, Johann, and Bernd Burgstaller. "Safe Non-blocking Synchronization in Ada2x." In Reliable Software Technologies – Ada-Europe 2018, 53–69. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-92432-8_4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bonnichsen, Lars, and Artur Podobas. "Using Transactional Memory to Avoid Blocking in OpenMP Synchronization Directives." In OpenMP: Heterogenous Execution and Data Movements, 149–61. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-24595-9_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Krishna, Siddharth, Michael Emmi, Constantin Enea, and Dejan Jovanović. "Verifying Visibility-Based Weak Consistency." In Programming Languages and Systems, 280–307. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-44914-8_11.

Full text

Abstract:

AbstractMultithreaded programs generally leverage efficient and thread-safe concurrent objects like sets, key-value maps, and queues. While some concurrent-object operations are designed to behave atomically, each witnessing the atomic effects of predecessors in a linearization order, others forego such strong consistency to avoid complex control and synchronization bottlenecks. For example, contains (value) methods of key-value maps may iterate through key-value entries without blocking concurrent updates, to avoid unwanted performance bottlenecks, and consequently overlook the effects of some linearization-order predecessors. While such weakly-consistent operations may not be atomic, they still offer guarantees, e.g., only observing values that have been present.In this work we develop a methodology for proving that concurrent object implementations adhere to weak-consistency specifications. In particular, we consider (forward) simulation-based proofs of implementations against relaxed-visibility specifications, which allow designated operations to overlook some of their linearization-order predecessors, i.e., behaving as if they never occurred. Besides annotating implementation code to identify linearization points, i.e., points at which operations’ logical effects occur, we also annotate code to identify visible operations, i.e., operations whose effects are observed; in practice this annotation can be done automatically by tracking the writers to each accessed memory location. We formalize our methodology over a general notion of transition systems, agnostic to any particular programming language or memory model, and demonstrate its application, using automated theorem provers, by verifying models of Java concurrent object implementations.

APA, Harvard, Vancouver, ISO, and other styles

4

Herlihy, Maurice, Nir Shavit, Victor Luchangco, and Michael Spear. "Monitors and blocking synchronization." In The Art of Multiprocessor Programming, 183–200. Elsevier, 2021. http://dx.doi.org/10.1016/b978-0-12-415950-1.00018-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Grossberg, Stephen. "From Knowing to Feeling." In Conscious Mind, Resonant Brain, 480–516. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780190070557.003.0013.

Full text

Abstract:

Visual and auditory processes represent sensory information, but do not evaluate its importance for survival or success. Interactions between perceptual/cognitive and evaluative reinforcement/emotional/motivational mechanisms accomplish this. Cognitive-emotional resonances support conscious feelings, knowing their source, and controlling motivation and responses to acquire valued goals. Also explained is how emotions may affect behavior without being conscious, and how learning adaptively times actions to achieve desired goals. Breakdowns in cognitive-emotional resonances can cause symptoms of mental disorders such as depression, autism, schizophrenia, and ADHD, including explanations of how affective meanings fail to organize behavior when this happens. Historic trends in the understanding of cognition and emotion are summarized, including work of Chomsky and Skinner. Brain circuits of conditioned reinforcer learning and incentive motivational learning are modeled, including the inverted-U in conditioning as a function of interstimulus interval, secondary conditioning, and attentional blocking and unblocking. How humans and animals act as minimal adaptive predictors is explained using the CogEM model’s interactions between sensory cortices, amygdala, and orbitofrontal cortex. Cognitive-emotional properties solve phylogenetically ancient Synchronization and Persistence Problems using circuits that are conserved between mollusks and humans. Avalanche command circuits for learning arbitrary sequences of sensory-motor acts, dating back to crustacea, increase their sensitivity to environmental feedback as they morph over phylogeny into mammalian cognitive and emotional circuits. Antagonistic rebounds drive affective extinction. READ circuits model how life-long learning occurs without associative saturation or passive forgetting. Affective memories of opponent emotions like fear vs. relief can then persist until they are disconfirmed by environmental feedback.

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Blocking synchronization"

1

Souza, Paulo, Raphael Batista, Simone Souza, Rafael Prado, George Dourado, and Julio Estrella. "Trace Generation and Deterministic Execution for Concurrent Programs." In XVII Simpósio em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação - SBC, 2016. http://dx.doi.org/10.5753/wscad.2016.14256.

Full text

Abstract:

This paper proposes new algorithms for generation of trace ﬁles and deterministic execution of concurrent programs under test. The proposed algorithms are essential to automate the coverage testing of concurrent programs and allow to execute new synchronizations automatically, increasing the source code coverage with focus on non-determinism, and edges of communication and synchronization. Our algorithms consider programs with multiple paradigms of communication and synchronization (collective, blocking and non-blocking point-to-point message passing, and shared memory). We validate our algorithms by means of experiments based on nine representative benchmarks, which exercise non-trivial aspects of synchronization found in real applications. Our algorithms have a robust behaviour and meet their objectives. We also highlight the overhead generated with the algorithms.

APA, Harvard, Vancouver, ISO, and other styles

2

Michael, Maged. "Non-Blocking Synchronization and Memory Management." In Applicative 2015. New York, New York, USA: ACM Press, 2015. http://dx.doi.org/10.1145/2742580.2742802.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Maruf, Abdullah Al, and Sandip Roy. "Observability-Blocking Controllers for Network Synchronization Processes." In 2019 American Control Conference (ACC). IEEE, 2019. http://dx.doi.org/10.23919/acc.2019.8815317.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Moir, Mark. "Practical implementations of non-blocking synchronization primitives." In the sixteenth annual ACM symposium. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/259380.259442.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Zhang, Jiange, Qing Yi, and Damian Dechev. "Automating Non-Blocking Synchronization In Concurrent Data Abstractions." In 2019 34th IEEE/ACM International Conference on Automated Software Engineering (ASE). IEEE, 2019. http://dx.doi.org/10.1109/ase.2019.00074.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Evequoz, Claude. "Non-Blocking Concurrent FIFO Queues with Single Word Synchronization Primitives." In 2008 37th International Conference on Parallel Processing (ICPP). IEEE, 2008. http://dx.doi.org/10.1109/icpp.2008.82.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Wang, Liqiang, and Scott D. Stoller. "Static analysis of atomicity for programs with non-blocking synchronization." In the tenth ACM SIGPLAN symposium. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1065944.1065953.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Garza, Arturo, Claudio A. Parra, and Isaac D. Scherson. "Non-Blocking Technique for Parallel Algorithms with Global Barrier Synchronization." In 2021 International Conference on Computational Science and Computational Intelligence (CSCI). IEEE, 2021. http://dx.doi.org/10.1109/csci54926.2021.00334.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Greenwald, Michael, and David Cheriton. "The synergy between non-blocking synchronization and operating system structure." In the second USENIX symposium. New York, New York, USA: ACM Press, 1996. http://dx.doi.org/10.1145/238721.238767.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Alemany, Juan, and Edward W. Felten. "Performance issues in non-blocking synchronization on shared-memory multiprocessors." In the eleventh annual ACM symposium. New York, New York, USA: ACM Press, 1992. http://dx.doi.org/10.1145/135419.135446.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!