Critical Sectionって何かをarXivで検索して考える。
Critical section in arXiv
2 Migration-Based Synchronization
https://arxiv.org/pdf/2202.09365
Authors: Stefan Reif, Phillip Raffeck, Luis Gerhorst, Wolfgang Schröder-Preikschat, Timo Hönig
1 arXiv:2202.09365 [pdf, other] cs.OS doi 10.1109/SBESC53686.2021.9628358
Abstract: …with control-flow migration to achieve synchronized memory accesses with guaranteed data locality. This leads to both shorter and more predictable execution times for critical sections. As MBS can be used as a substitute for classical locks, it can be employed in legacy applications without code alterations.We further… ▽ More
Submitted 18 February, 2022; originally announced February 2022.
Journal ref: SBESC'21: Proceedings of the XI Brazilian Symposium on Computing Systems Engineering. 2021. IEEE, Pages 1-8
2. Verification of Component-based Systems with Recursive Architectures
https://arxiv.org/pdf/2112.08292
Authors: Marius Bozga, Radu Iosif, Joseph Sifakis
arXiv:2112.08292 [pdf, other] cs.FL cs.LO
Abstract: …algebraic data types or recursive data structures. For parametric systems specified in this logic, we show that decision problems such as reaching deadlock or violating critical section are undecidable, in general. Despite this negative result, we provide for these decision problems practical semi-algorithms relying on… ▽ More
Submitted 15 December, 2021; originally announced December 2021.
3.Fair Mutual Exclusion for N Processes (extended version)
arXiv:2111.02251 [pdf, ps, other] cs.LO cs.DC
https://arxiv.org/pdf/2111.02251
Authors: Yousra Hafidi, Jeroen J. A. Keiren, Jan Friso Groote
Abstract: …, when a process requests access to the critical section, other processes can enter first at most (N−1)(N−2) times. ▽ More
Submitted 3 November, 2021; originally announced November 2021.
Comments: To appear in TMPA'21
REFERENCES
[1] AMD 2019. AMD64 Architecture Programmer’s Manual Volume 3: General Purpose and System Instructions. AMD. https://www.amd.com/system/files/TechDocs/24594.pdf
[2] J. H. Anderson and Y.-J. Kim. 2002. An Improved Lower Bound for the Time Complexity of Mutual Exclusion. Distributed Computing (DC) 15, 4 (Dec. 2002), 221–253. https://doi.org/10.1007/s00446-002-0084-2
[3] A. Arcangeli, M. Cao, P. E. McKenney, and D. Sarma. 2003. Using Read-Copy-Update Techniques for System V IPC in the Linux 2.5 Kernel. In USENIX Annual Technical Conference, FREENIX Track. 297–309.
[4] H.Attiya,D.Hendler,andP.Woelfel.2008.TightRMRLowerBoundsforMutualExclusionandOtherProblems.InProceedingsofthe40thAnnual ACM Symposium on Theory of Computing (STOC). ACM, New York, NY, USA, 217–226. https://doi.org/10.1145/1374376.1374410
[5] P. Bohannon, D. Lieuwen, and A. Silberschatz. 1996. Recovering Scalable Spin Locks. In Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing (SPDP). IEEE Computer Society, Washington, DC, USA, 314–322. http://dl.acm.org/citation.cfm?id=829517.830751
[6] P. Bohannon, D. Lieuwen, A. Silberschatz, S. Sudarshan, and J. Gava. 1995. Recoverable User-level Mutual Exclusion. In Proceed- ings of the 7th IEEE Symposium on Parallel and Distributed Processing (SPDP). IEEE Computer Society, Washington, DC, USA, 293–301. http://dl.acm.org/citation.cfm?id=829516.830651
[7] D. Chan and P. Woelfel. 2021. A Tight Lower Bound for the RMR Complexity of Recoverable Mutual Exclusion. In Proceedings of the 40th ACM Symposium on Principles of Distributed Computing (PODC). Association for Computing Machinery (ACM).
[8] D. Y. C. Chan and P. Woelfel. 2020. Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives. In Proceedings of the 39th ACM Symposium on Principles of Distributed Computing (PODC). Association for Computing Machinery (ACM), New York, NY, USA, 10.
[9] E.W.Dijkstra.1965.SolutionofaProbleminConcurrentProgrammingControl.CommunicationsoftheACM(CACM)8,9(1965),569.
[10] R.DvirandG.Taubenfeld.2017.MutualExclusionAlgorithmswithConstantRMRComplexityandWait-FreeExitCode.InProceedingsofthe21st International Conference on Principles of Distributed Systems (OPODIS), James Aspnes, Alysson Bessani, Pascal Felber, and João Leitão (Eds.), Vol. 95.
Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 17:1–17:16. https://doi.org/10.4230/LIPIcs.OPODIS.2017.17
[11] K. Fraser. 2004. Practical Lock-Freedom. Ph.D. Dissertation. University of Cambridge.
[12] W. Golab and D. Hendler. 2017. Recoverable Mutual Exclusion in Sub-Logarithmic Time. In Proceedings of the ACM Symposium on Principles of
Distributed Computing (PODC). ACM, New York, NY, USA, 211–220. https://doi.org/10.1145/3087801.3087819
[13] W.GolabandD.Hendler.2018.RecoverableMutualExclusionUnderSystem-WideFailures.InProceedingsoftheACMSymposiumonPrinciplesof
Distributed Computing (PODC). ACM, New York, NY, USA, 17–26. https://doi.org/10.1145/3212734.3212755
[14] W.Golab,D.Hendler,andP.Woelfel.2006.An𝑂(1)RMRsLeaderElectionAlgorithm.InProceedingsofthe25thACMSymposiumonPrinciplesofDis-
tributedComputing(PODC).AssociationforComputingMachinery(ACM),NewYork,NY,USA,238—-247. https://doi.org/10.1145/1146381.1146417
[15] W. Golab and A. Ramaraju. 2016. Recoverable Mutual Exclusion: [Extended Abstract]. In Proceedings of the ACM Symposium on Principles of
Distributed Computing (PODC). ACM, New York, NY, USA, 65–74. https://doi.org/10.1145/2933057.2933087
[16] W. Golab and A. Ramaraju. 2019. Recoverable Mutual Exclusion. Distributed Computing (DC) 32, 6 (Nov. 2019), 535–564.
[17] T. E. Hart, P. E. McKenney, A. D. Brown, and J. Walpole. 2007. Performance of Memory Reclamation for Lockless Synchronization. Journal of
Parallel and Distributed Computing (JPDC) 67, 12 (2007), 1270–1285.
[18] Intel 2016. Intel 64 and IA-32 Architectures Software Developer’s Manual, Volume 2A: Instruction Set Reference, A-M. Intel. https://software.intel.com/sites/default/files/managed/a4/60/325383-sdm-vol-2abcd.pdf
[19] P. Jayanti, S. Jayanti, and A. Joshi. 2019. A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). ACM, New York, NY, USA, 177–186. https://doi.org/10.1145/3293611.3331634
[20] P. Jayanti and A. Joshi. 2017. Recoverable FCFS Mutual Exclusion with Wait-Free Recovery. In Proceedings of the 31st Symposium on Dis- tributed Computing (DISC), Andréa W. Richa (Ed.), Vol. 91. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 30:1–30:15. https://doi.org/10.4230/LIPIcs.DISC.2017.30
[21] P.JayantiandA.Joshi.2019.RecoverableMutualExclusionwithAbortability.InProceedingsoftheInternationalConferenceonNetworkedSystems (NETSYS). Springer International Publishing, 217–232.
[22] D. Katzan and A. Morrison. 2021. Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity. In Proceed- ings of the 24th International Conference on Principles of Distributed Systems (OPODIS) (Leibniz International Proceedings in Informatics (LIPIcs)), Q. Bramas, R. Oshman, and P. Romano (Eds.), Vol. 184. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 15:1–15:16. https://doi.org/10.4230/LIPIcs.OPODIS.2020.15
[23] P. E. McKenney and J. D. Slingwine. 1998. Read-Copy Update: Using Execution History to Solve Concurrency Problems. In Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems. 509–518.
[24] J. M. Mellor-Crummey and M. L. Scott. 1991. Algorithms for Scalable Synchronization on Shared-Memory Multiprocessors. ACM Transactions on Computer Systems 9, 1 (Feb. 1991), 21–65. https://doi.org/10.1145/103727.103729
[25] D.NarayananandO.Hodson.2012.Whole-SystemPersistence.InProceedingsoftheInternationalConferenceonArchitecturalSupportforProgram- ming Languages and Operating Systems (ASPLOS). ACM, New York, NY, USA, 401–410.
[26] A. Ramaraju. 2015. RGLock: Recoverable Mutual Exclusion for Non-Volatile Main Memory Systems. Master’s thesis. Electrical and Computer Engi- neeringDepartment,UniversityofWaterloo. http://hdl.handle.net/10012/9473
[27] J.-H. Yang and J. H. Anderson. 1995. A Fast, Scalable Mutual Mxclusion Algorithm. Distributed Computing (DC) 9, 1 (March 1995), 51–60. https://doi.org/10.1007/BF01784242
4.arXiv:2110.08308 [pdf, ps, other] cs.DC
Adaptive and Fair Transformation for Recoverable Mutual Exclusion
Authors: Sahil Dhoked, Neeraj Mittal
Abstract: …Traditionally, mutual exclusion algorithms have been designed under the assumption that a process does not fail while acquiring/releasing a lock or while executing its critical… ▽ More
Submitted 15 October, 2021; originally announced October 2021.
Comments: arXiv admin note: substantial text overlap with arXiv:2006.07086
arXiv:2110.05545 [pdf, other] cs.DC
Peformance Prediction for Coarse-Grained Locking: MCS Case
Authors: Vitaly Aksenov, Daniil Bolotov, Petr Kuznetsov
Abstract: …design pattern found in many concurrent data structures, such as hash tables or ordered containers, is alternation of parallelizable sections that incur no data conflicts and critical sections that must run sequentially and are protected with locks. It was already shown that simple stochastic analysis can predict the t… ▽ More
Submitted 11 October, 2021; originally announced October 2021.
arXiv:2107.14778 [pdf, other] math.MG
Critical central sections of the cube
Authors: Gergely Ambrus
Abstract: We study the volume of central hyperplane sections of the cube. Using Fourier analytic and variational methods, we retrieve a geometric condition characterizing critical sections which, by entirely different methods, was recently proven by Ivanov and Tsiutsiurupa. Using this characterization result, we prove that criti… ▽ More
Submitted 12 December, 2021; v1 submitted 30 July, 2021; originally announced July 2021.
Comments: Final version, accepted for publication in Proceedings of Amer. Math. Soc
MSC Class: 52A40; 52A38; 49Q20
arXiv:2106.01995 [pdf, other] math.DG
Discrete Lagrange problems with constraints valued in a Lie group
Authors: Pablo M. Chacón, Antonio Fernández, Pedro L. García
Abstract: …established in the discrete field theory for constraints with values in a Lie group. For the admissible sections that satisfy a certain regularity condition, we prove that the critical sections of such problems are the solutions of a canonically unconstrained variational problem associated with the Lagrange problem (di… ▽ More
Submitted 6 April, 2022; v1 submitted 3 June, 2021; originally announced June 2021.
Comments: Minor changes in the introduction and other minor corrections
MSC Class: 2020 MSC. Primary: 58A20; 53A70; Secondary :57R15; 49N99; 53Z05; 58E30
arXiv:2106.01710 [pdf, other] cs.DC cs.PF cs.PL
Optimistic Concurrency Control for Real-world Go Programs (Extended Version with Appendix)
Authors: Zhizhou Zhang, Milind Chabbi, Adam Welc, Timothy Sherwood
Abstract: …and filter lock-protected regions and performs AST-level code transformation of the surrounding locks when profitable. Profitability is driven by both static analyses of critical sections and dynamic analysis via execution profiles. A custom HTM library, using perceptron, learns concurrency behavior and dynamically dec… ▽ More
Submitted 3 June, 2021; originally announced June 2021.
arXiv:2010.09854 [pdf, other] cs.DC
High-Performance Distributed RMA Locks
Authors: Patrick Schmid, Maciej Besta, Torsten Hoefler
Abstract: …and data centers. The core idea behind the lock is a modular design that is an interplay of three distributed data structures: a counter of readers/writers in the critical section, a set of queues for ordering writers waiting for the lock, and a tree that binds all the queues and synchronizes writers with readers. Each… ▽ More
Submitted 23 October, 2020; v1 submitted 19 October, 2020; originally announced October 2020.
Comments: Best Paper Award at ACM HPDC'16 (1/129)
Journal ref: Proceedings of the 25th ACM International Symposium on High-Performance Parallel and Distributed Computing (ACM HPDC'16), 2016
arXiv:2010.04414 [pdf, other] cs.DC cs.LG
A Vertex Cut based Framework for Load Balancing and Parallelism Optimization in Multi-core Systems
Authors: Guixiang Ma, Yao Xiao, Theodore L. Willke, Nesreen K. Ahmed, Shahin Nazarian, Paul Bogdan
Abstract: …programs running on high-performance computers often suffer from data communication bottlenecks, limited memory bandwidth, and synchronization overhead due to irregular critical sections. In this paper, we propose a framework to reduce the data communication and improve the scalability and performance of these applicat… ▽ More
Submitted 9 October, 2020; originally announced October 2020.
arXiv:2007.08302 [pdf, other] cs.OS
Scheduling of Real-Time Tasks with Multiple Critical Sections in Multiprocessor Systems
Authors: Jian-Jia Chen, Junjie Shi, Georg von der Brüggen, Niklas Ueter
Abstract: …The recently proposed Dependency Graph Approach showed its advantages and attracted a lot of interest. It is, however, restricted to task sets where each task has at most one critical… ▽ More
Submitted 16 July, 2020; originally announced July 2020.
arXiv:2006.07086 [pdf, ps, other] cs.DC cs.DS cs.OS
An Adaptive Approach to Recoverable Mutual Exlcusion
Authors: Sahil Dhoked, Neeraj Mittal
Abstract: …Traditionally, mutual exclusion algorithms have been designed under the assumption that a process does not fail while acquiring/releasing a lock or while executing its critical section. However, failures do occur in real life, potentially leaving the lock in an inconsistent state. This gives rise to the problem of \em… ▽ More
Submitted 3 August, 2020; v1 submitted 12 June, 2020; originally announced June 2020.
arXiv:2005.00263 [pdf, other] cs.DC
doi
10.1145/3392717.3392773
How I Learned to Stop Worrying About User-Visible Endpoints and Love MPI
Authors: Rohit Zambre, Aparna Chandramowlishwaran, Pavan Balaji
Abstract: …are to blame for this slowdown. Typically, MPI users do not expose logical communication parallelism. Consequently, MPI libraries use conservative approaches, such as a global critical section, to maintain MPI's ordering constraints for MPI+threads, thus serializing access to parallel network resources and hurting… ▽ More
Submitted 1 May, 2020; originally announced May 2020.
Comments: In Proceedings of the 34th ACM International Conference on Supercomputing (ICS), Barcelona, Spain, June 2020
ACM Class: C.2.4
arXiv:2004.10033 [pdf, ps, other] cs.DC
On the Relevance of Wait-free Coordination Algorithms in Shared-Memory HPC:The Global Virtual Time Case
Authors: Alessandro Pellegrini, Francesco Quaglia
Abstract: …an innovative wait-free implementation, emphasizing on what design choices must be made to enforce this paradigm shift, and what are the performance implications of removing critical sections in coordination algorithms. ▽ More
Submitted 21 April, 2020; originally announced April 2020.
arXiv:1909.09600 [pdf, other] cs.DC cs.OS
Multiprocessor Real-Time Locking Protocols: A Systematic Review
Authors: Björn B. Brandenburg
Abstract: …protocols, binary semaphore protocols, independence-preserving (or fully preemptive) locking protocols, reader-writer and k-exclusion synchronization, support for nested critical sections, and implementation and system-integration aspects. A special focus is placed on the suspension-oblivious and suspension-aware analy… ▽ More
Submitted 20 September, 2019; originally announced September 2019.
arXiv:1906.00490 [pdf, other] cs.DC
Mutable Locks: Combining the Best of Spin and Sleep Locks
Authors: Romolo Marotta, Davide Tiriticco, Pierangelo Di Sanzo, Alessandro Pellegrini, Bruno Ciciani, Francesco Quaglia
Abstract: …semantic of traditional locks (such as spin locks or sleep locks), but with a self-tuned optimized trade off between responsiveness---in the access to a just released critical section---and CPU-time usage during threads' wait phases. It tackles the need for modern synchronization supports, in the era of multi-core… ▽ More
Submitted 14 June, 2019; v1 submitted 2 June, 2019; originally announced June 2019.
Comments: Added a missing author
arXiv:1905.00494 [pdf, other] cs.SE
doi
10.1145/3385412.3385993
SmartTrack: Efficient Predictive Race Detection
Authors: Jake Roemer, Kaan Genç, Michael D. Bond
Abstract: …incorporates two main optimizations: (1) epoch and ownership optimizations from prior work, applied to predictive analysis for the first time; and (2) novel conflicting critical section optimizations introduced by this paper. Our evaluation shows that SmartTrack achieves performance competitive with FastTrack-a qualita… ▽ More
Submitted 8 April, 2020; v1 submitted 1 May, 2019; originally announced May 2019.
Comments: Extended arXiv version of PLDI 2020 paper (adds Appendices A-E) #228 SmartTrack: Efficient Predictive Race Detection
arXiv:1904.11323 [pdf, other] cs.DC cs.DS
Performance Prediction for Coarse-Grained Locking
Authors: Vitaly Aksenov, Dan Alistarh, Petr Kuznetsov
Abstract: …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… ▽ More
Submitted 25 April, 2019; originally announced April 2019.
arXiv:1903.10402 [pdf, ps, other] cs.DC cs.DS
Two Mutual Exclusion Algorithms for Shared Memory
Authors: Jordi Bataller Mascarell
Abstract: …that solve the mutual exclusion problem for concurrent processes that communicate through shared variables, [2]. Our algorithms guarantee that any process trying to enter the critical… ▽ More
Submitted 25 March, 2019; originally announced March 2019.
arXiv:1903.02843 [pdf, other] cs.DC
Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)
Authors: Shlomi Dolev, Sayaka Kamei, Yoshiaki Katayama, Fukuhito Ooshita, Koichi Wada
Abstract: Local mutual exclusion guarantees that no two neighboring processes enter a critical… ▽ More
Submitted 7 March, 2019; originally announced March 2019.
Comments: 16 pages
arXiv:1901.04942 [pdf, other] cs.SE
doi
10.1109/SCAM.2018.00012
Obfuscating Java Programs by Translating Selected Portions of Bytecode to Native Libraries
Authors: Davide Pizzolotto, Mariano Ceccato
Abstract: …machine code contains and leaks less high level information and it enables more resilient obfuscations. In this paper, we present an approach to automatically translate critical sections of high level Java bytecode to C code, so that more effective obfuscations can be resorted to. Moreover, a developer can still wor… ▽ More
Submitted 15 January, 2019; originally announced January 2019.
Journal ref: 018 IEEE 18th International Working Conference on Source Code Analysis and Manipulation, (SCAM 2018)
arXiv:1810.03723 [pdf, ps, other] cs.DC
Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
Authors: Zahra Aghazadeh, Damien Imbs, Michel Raynal, Gadi Taubenfeld, Philipp Woelfel
Abstract: …. These algorithms differ in their design principles and their costs (measured as the number of registers which must contain the identity of a process to allow it to enter the critical section). The paper also shows that the condition m∈M(n) is necessary for deadlock-free mutex on top of anonymous read/modify/writ… ▽ More
Submitted 8 October, 2018; originally announced October 2018.
arXiv:1807.05674 [pdf, ps, other] cs.DC
An asynchronous message-passing distributed algorithm for the global critical section problem
Authors: Sayaka Kamei, Hirotsugu Kakugawa
Abstract: This paper considers the global (l,k)-CS problem which is the problem of controlling the system in such a way that, at least l and at most k processes must be in the CS at a time in the network. In this paper, a distributed solution is proposed in the asynchronous message-passing model. Our solution is a versatile composition method of algorithms for l-mutual inclusion and k-mutual exclu… ▽ More
Submitted 16 July, 2018; originally announced July 2018.
Comments: This is a modified version of the conference paper in PDAA2017
arXiv:1805.04819 [pdf, ps, other] cs.DC
Fast and Scalable Group Mutual Exclusion
Authors: Shreyas Gokhale, Neeraj Mittal
Abstract: The group mutual exclusion (GME) problem is a generalization of the classical mutual exclusion problem in which every critical… ▽ More
Submitted 8 July, 2019; v1 submitted 13 May, 2018; originally announced May 2018.
arXiv:1803.10067 [pdf, ps, other] cs.PL
Safe Non-blocking Synchronization in Ada 202x
Authors: Johann Blieberger, Bernd Burgstaller
Abstract: …property of locks stands in the way to scalability of parallel programs on many-core architectures. Locks do not allow progress guarantees, because a task may fail inside a critical section and keep holding a lock that blocks other tasks from accessing shared data. With non-blocking synchronization, the drawbacks of lo… ▽ More
Submitted 18 June, 2018; v1 submitted 27 March, 2018; originally announced March 2018.
arXiv:1711.09543 [pdf, other] cs.DB
DTranx: A SEDA-based Distributed and Transactional Key Value Store with Persistent Memory Log
Authors: Ning Gao, Zhang Liu, Dirk Grunwald
Abstract: …strategy to minimize context switch overhead. Moreover, we customize a hybrid commit protocol that combines optimistic concurrency control and two-phase commit to reduce critical section of distributed locking and introduce a locking mechanism to avoid deadlocks and livelocks. In our evaluations, DTranx reaches 514.1… ▽ More
Submitted 27 November, 2017; originally announced November 2017.
arXiv:1702.07081 [pdf, other] cs.DC
DyAdHyTM: A Low Overhead Dynamically Adaptive Hybrid Transactional Memory on Big Data Graphs
Authors: Mohammad Qayum, Abdel-Hameed Badawy, Jeanine Cook
Abstract: …networks, and cyber security, graphs are sparse in nature. Due to this sparsity, we have the opportunity to use Transactional Memory (TM) as the synchronization policy for critical sections to speedup applications. At low conflict probability TM performs better than most synchronization policies due to its inherent non… ▽ More
Submitted 2 March, 2017; v1 submitted 22 February, 2017; originally announced February 2017.
Comments: 13 pages
arXiv:1611.06184 [pdf] cond-mat.mtrl-sci
doi
10.1039/C6CP07922A
Discrete nature of inhomogeneity: The initial stages and local configurations of TiOPc during bilayer growth on Ag(111)
Authors: Laura Fernandez, Sebastian Thussing, Alexander Mänz, Jörg Sundermeyer, Gregor Witte, Peter Jakob
Abstract: …bulk properties of compound molecular species, but even more so on the influence of interfaces thereof. The identification and characterization of elemental processes in these critical sections of a device thereby requires well-defined interfaces with low defect density. In this context titanyl phthalocyanine (TiOPc) a… ▽ More
Submitted 18 November, 2016; originally announced November 2016.
Comments: 15 pages, 6 figures
arXiv:1606.05933 [pdf] cs.AR
Criticality Aware Multiprocessors
Authors: Sandeep Navada, Anil Krishna
Abstract: …to any particular memory request. But certain memory requests are more critical to multiprocessor's performance than other requests. Example: memory requests from critical sections, load request feeding into multiple dependent instructions, etc. This knowledge can be used to improve the performance of current multi… ▽ More
Submitted 19 June, 2016; originally announced June 2016.
arXiv:1512.08998 [pdf] physics.ed-ph
Cluster Analysis of Educational Data: an Example of Quantitative Study on the answers to an Open-Ended Questionnaire
Authors: Onofrio Rosario Battaglia, Benedetto Di Paola, Claudio Fazio
Abstract: …of the interpretation of quantitative results. Then two methods commonly used in Cluster Analysis are described and the variables and parameters involved are outlined and criticized. Section III deals with the application of these methods to the analysis of data from an open-ended questionnaire administered to a sample… ▽ More
Submitted 16 August, 2017; v1 submitted 30 December, 2015; originally announced December 2015.
Comments: 30 pages
arXiv:1511.07163 [pdf, other] cs.PL
Optimizing Solution Quality in Synchronization Synthesis
Authors: Pavol Černý, Edmund M. Clarke, Thomas A. Henzinger, Arjun Radhakrishna, Leonid Ryzhyk, Roopsha Samanta, Thorsten Tarrach
Abstract: …solutions using an objective function. We consider two types of objective functions: ones that are solely dependent on the program (e.g., minimizing the size of critical… ▽ More
Submitted 23 November, 2015; originally announced November 2015.
arXiv:1510.06706 [pdf, other] cs.NE cs.CV cs.DC cs.LG
doi
10.1109/IPDPS.2016.119
ZNN - A Fast and Scalable Algorithm for Training 3D Convolutional Networks on Multi-Core and Many-Core Shared Memory Machines
Authors: Aleksandar Zlateski, Kisuk Lee, H. Sebastian Seung
Abstract: …of the network with temporal locality to reduce cache misses, and sums the convergent convolution outputs via an almost wait-free concurrent method to reduce time spent in critical sections. We implement the algorithm with a publicly available software package called ZNN. Benchmarking with multi-core CPUs shows that ZN… ▽ More
Submitted 22 October, 2015; originally announced October 2015.
arXiv:1504.04640 [pdf, ps, other] cs.OS
The Influence of Malloc Placement on TSX Hardware Transactional Memory
Authors: Dave Dice, Tim Harris, Alex Kogan, Yossi Lev
Abstract: …from conflict misses can force the offending thread through the so-called "slow path". The slow path is undesirable as the thread must acquire the lock and run the critical… ▽ More
Submitted 29 April, 2015; v1 submitted 17 April, 2015; originally announced April 2015.
ACM Class: D.1.3
arXiv:1502.02287 [pdf, other] cs.OS
Protecting Memory-Performance Critical Sections in Soft Real-Time Applications
Authors: Heechul Yun, Santosh Gondi, Siddhartha Biswas
Abstract: …requiring a high memory bandwidth for a short duration of time. Such a period is often critical for timely data processing. Hence, we call it a memory-performance critical… ▽ More
Submitted 8 February, 2015; originally announced February 2015.
Comments: technical report
arXiv:1407.6968 [pdf, other] cs.PL
Hardware extensions to make lazy subscription safe
Authors: Dave Dice, Timothy L. Harris, Alex Kogan, Yossi Lev, Mark Moir
Abstract: Transactional Lock Elision (TLE) uses Hardware Transactional Memory (HTM) to execute unmodified critical… ▽ More
Submitted 23 July, 2014; originally announced July 2014.
Comments: 6 pages, extended version of WTTM2014 paper
arXiv:1311.1907 [pdf] cs.DC cs.PF
Proactive bottleneck performance analysis in parallel computing using openMP
Authors: Vibha Rajput, Alok Katiyar
Abstract: …This paper analyzes bottleneck performance as bottleneck inhibits performance. Performance of multi threaded applications is limited by a variety of bottlenecks, e.g. critical sections, barriers and so on. This paper provides some tips how to avoid performance bottleneck problems. This paper focuses on how to reduce o… ▽ More
Submitted 8 November, 2013; originally announced November 2013.
Comments: 8 Pages,6 figure
Journal ref: IJASCSE, Volume 2, Issue 5, 2013
arXiv:1305.3849 [pdf, other] cs.OS
On the periodic behavior of real-time schedulers on identical multiprocessor platforms
Authors: Emmanuel Grolleau, Joël Goossens, Liliana Cucu-Grosjean
Abstract: …algorithms), for any context, on identical multiprocessor platforms. By context we mean the hardware architecture (uniprocessor, multicore), as well as task constraints like critical sections, precedence constraints, self-suspension, etc. Since the result is based only on the releases and deadlines, it is independent f… ▽ More
Submitted 16 May, 2013; originally announced May 2013.
arXiv:1208.1723 [pdf, ps, other] cs.DC cs.DS
RMR-Efficient Randomized Abortable Mutual Exclusion
Authors: Abhijeet Pareek, Philipp Woelfel
Abstract: …read, write and compare-and-swap (short: CAS) operations. In such a model, the asymptotically tight upper and lower bound on the number of RMRs per passage through the Critical… ▽ More
Submitted 8 August, 2012; originally announced August 2012.
Comments: Extended abstract will appear at DISC 2012
arXiv:1204.6170 [pdf, ps, other] cs.DC
A distributed resource allocation algorithm for many processes
Authors: Wim H. Hesselink
Abstract: Resource allocation is the problem that a process may enter a critical section CS of its code only when its resource requirements are not in conflict with those of other processes in their critical sections. For each execution of CS, these… ▽ More
Submitted 31 May, 2012; v1 submitted 27 April, 2012; originally announced April 2012.
Comments: 30 pages
arXiv:1203.6412 [pdf, ps, other] cs.LO
doi
10.2168/LMCS-8(2:2)2012
Barriers in Concurrent Separation Logic: Now With Tool Support!
Authors: Aquinas Hobor, Cristian Gherghina
Abstract: …Although Pthreads barriers are widely used in systems, and separation logic is widely used for verification, there has not been any effort to combine the two. Unlike locks and critical sections, Pthreads barriers enable simultaneous resource redistribution between multiple threads and are inherently stateful, leading t… ▽ More
Submitted 19 April, 2012; v1 submitted 28 March, 2012; originally announced March 2012.
ACM Class: D.1.3 , D.2.1 D.2.4, D.4.4, F.3.1, F.3.3, F.4.1, F.4.3
Journal ref: Logical Methods in Computer Science, Volume 8, Issue 2 (April 20, 2012) lmcs:800
arXiv:1111.5775 [pdf, ps, other] cs.DC
Partial mutual exclusion for infinitely many processes
Authors: Wim H. Hesselink
Abstract: Partial mutual exclusion is the drinking philosophers problem for complete graphs. It is the problem that a process may enter a critical… ▽ More
Submitted 6 December, 2011; v1 submitted 24 November, 2011; originally announced November 2011.
arXiv:1001.3044 [pdf, ps, other] cs.DS
Dynamic sharing of a multiple access channel
Authors: Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski
Abstract: …accessing it. We consider both the classic and a slightly weaker version of mutual exclusion, called ep-mutual-exclusion, where for each period of a process staying in the critical… ▽ More
Submitted 3 February, 2010; v1 submitted 18 January, 2010; originally announced January 2010.
arXiv:0811.3492 [pdf, ps, other] cs.SE
Dynamic System Adaptation by Constraint Orchestration
Authors: L. P. J. Groenewegen, E. P. de Vink
Abstract: …Paradigm's constraint orchestration, also for originally unforeseen evolution. UML-like diagrams visually supplement such migration, as is illustrated for the case of a critical section solution evolving into a pipeline architecture. ▽ More
Submitted 21 November, 2008; originally announced November 2008.
Comments: 19 pages
Report number: CSR 08/29 ACM Class: D.2.11; F.3.1
arXiv:cs/0410068 [pdf, ps, other] cs.CR cs.AI
Analyzing and Improving Performance of a Class of Anomaly-based Intrusion Detectors
Authors: Zhuowei Li, Amitabha Das
Abstract: …the cost and performance of stide-like detectors which are based on sequence analysis. The first application reduces the cost of developing AID detectors by identifying the critical sections in the training dataset, and the second application identifies the intrusion context in the intrusive dataset, that helps to fine… ▽ More
Submitted 25 October, 2004; originally announced October 2004.
Comments: Submit to journal for publication
Report number: cais-tr-2004-001
arXiv:math-ph/0311022 [pdf, ps, other] math-ph math.DG
doi
10.1016/j.difgeo.2004.07.008
The Hessian and Jacobi Morphisms for Higher Order Calculus of Variations
Authors: M. Francaviglia, M. Palese, R. Vitolo
Abstract: …of the Euler-Lagrange equations. These two objects, respectively, generalize in an invariant way the Hessian morphism and the Jacobi morphism (which is then self-adjoint along critical sections) of a given Lagrangian to the case of higher order Lagrangians. Some examples of classical Lagrangians are provided to illustr… ▽ More
Submitted 31 May, 2004; v1 submitted 13 November, 2003; originally announced November 2003.
Comments: 19 pages, minor changes, final version to appear in Diff. Geom. Appl
MSC Class: 58A20; 58E30
Journal ref: Diff. Geom. Appl. 22(1) (2005) 105-120
arXiv:math-ph/0305031 [pdf, ps, other] math-ph math.DG
doi
10.2991/jnmp.2003.10.4.7
A variational principle for volume-preserving dynamics
Authors: G. Gaeta, P. Morando
Abstract: …description of any Liouville (i.e. volume preserving) autonomous vector fields on a smooth manifold. This is obtained via a ``maximal degree'' variational principle; critical sections for this are integral manifolds for the Liouville vector field. We work in coordinates and provide explicit formulae. ▽ More
Submitted 14 May, 2003; originally announced May 2003.
MSC Class: 34A26; 37C10; 70G75
Journal ref: J. Nonlin. Math. Phys. 10 (2003), 539-554