Filters








6,322 Hits in 7.7 sec

Wait-Free CAS-Based Algorithms: The Burden of the Past

Denis Bédin, François Lépine, Achour Mostéfaoui, Damien Perez, Matthieu Perrin, Seth Gilbert
2021
In this paper, we prove that CAS does not allow to implement wait-free and linearizable visible objects in the infinite model with a space complexity bounded by the number of active processes (i.e. ones  ...  Herlihy proved that CAS is universal in the classical computing system model composed of an a priori known number of processes.  ...  The quiescent complexity of Algorithm 2 is QC(n) = O(f (n)). Wait-Free CAS-Based Algorithms: The Burden of the Past Proof.  ... 
doi:10.4230/lipics.disc.2021.11 fatcat:jhueuleidvgrjpw3owezfgbjmq

The pauseless GC algorithm

Cliff Click, Gil Tene, Michael Wolf
2005 Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments - VEE '05  
Portions of the Pauseless algorithm also feature a "self-healing" behavior which limits mutator overhead and reduces mutator sensitivity to the current GC state.  ...  No phase places an undue burden on the mutators nor do phases race to complete before the mutators produce more work.  ...  Based on this data, we encourage the GC research community to test the end-to-end effects of GC algorithms carefully.  ... 
doi:10.1145/1064979.1064988 dblp:conf/vee/ClickTW05 fatcat:64v2tlpwwvfarfw6mjyibsys2e

Parallel algorithms for simulating continuous time Markov chains

David M. Nicol, Philip Heidelberger
1993 Proceedings of the seventh workshop on Parallel and distributed simulation - PADS '93  
We surely can develop the message at time t and if that message is not yet present, the entire processor blocks. However, it may be that another piece of the submodel is free to continue past time t.  ...  , each LP is classified as being ready or blocked, depending on whether it is free to execute or is waiting for an incoming message.waiting for a message, a description of that message is stored in a binary  ... 
doi:10.1145/158459.158461 fatcat:al4k5ba5xndtbfdquoz535haii

The Ethics of Algorithmic Outsourcing in Everyday Life [chapter]

John Danaher
2019 Algorithmic Regulation  
This chapter focuses on one specific application of algorithmic regulation: the use of AI-based personal digital assistants.  ...  Finally, it looks at responses to these threats at both the individual and societal level, and argues that although an attitude of 'helplessness' should not be encouraged among users of algorithmic tools  ...  Acknowledgements: I would like to thank Karen Yeung for her helpful comments on a previous draft of this paper. I would also like to thank the attendees at a Whitaker  ... 
doi:10.1093/oso/9780198838494.003.0005 fatcat:2bcughcbdfck5npakirvbukkdu

Nonblocking k-compare-single-swap

Victor Luchangco, Mark Moir, Nir Shavit
2003 Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03  
This paper aims at a middle ground: reasonably efficient multilocation operations that are general enough to reduce the design difficulties of algorithms based on CAS alone.  ...  We present an obstruction-free implementation of an atomic k-location-compare single-swap (KCSS) operation.  ...  Acknowledgments: We thank Paul Martin for valuable comments on initial versions of our algorithm, and Tim Harris for his many comments and for suggesting optimizations to the snapshot algorithm.  ... 
doi:10.1145/777412.777468 dblp:conf/spaa/LuchangcoMS03 fatcat:luovkjy34zhmrgwsjkiooxjol4

A* Algorithm [chapter]

2013 Encyclopedia of Operations Research and Management Science  
A heuristic search procedure that selects a node in its search tree for expansion such that the selected node has minimum value of the sum of the cost to reach the node plus a heuristic cost value for  ...  that node, where the heuristic cost underestimates the true minimum cost of completion.  ...  Many models now thought of as agent-based simulations were originally developed in the form of cellular automata (CA).  ... 
doi:10.1007/978-1-4419-1153-7_200001 fatcat:pqhbvw2wtjefrdr64yendafiya

Nonblocking k-compare-single-swap

Victor Luchangco, Mark Moir, Nir Shavit
2003 Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '03  
This paper aims at a middle ground: reasonably efficient multilocation operations that are general enough to reduce the design difficulties of algorithms based on CAS alone.  ...  We present an obstruction-free implementation of an atomic k-location-compare single-swap (KCSS) operation.  ...  Acknowledgments: We thank Paul Martin for valuable comments on initial versions of our algorithm, and Tim Harris for his many comments and for suggesting optimizations to the snapshot algorithm.  ... 
doi:10.1145/777466.777468 fatcat:7qx5nm7o3bhn3oxxlr6mgamhju

Integrated Simulation-Based Optimization of Operational Decisions at Container Terminals

Marvin Kastner, Nicole Nellen, Anne Schwientek, Carlos Jahn
2021 Algorithms  
The results show that simulation-based optimization is suitable for identifying the amount of required equipment and well-performing policies.  ...  The developed procedure simultaneously scales the amount of utilized equipment and adjusts the selection and tuning of operational policies.  ...  The median shows that using 4 QCs instead of 3 results in a reduction of ca. 20% in the makespan. By doubling the number of QCs from 3 to 6, the performance can be increased by ca. 57%.  ... 
doi:10.3390/a14020042 fatcat:nwcevpgnebdz3pohpogrdkdbxm

Text as Algorithm and as Process [chapter]

Paul Eggert
2010 Text and Genre in Reconstruction  
Short, for unstinting support of the Seminar from which most of the essays in this volume originated.  ...  Acknowledgements All of us who have contributed to this volume, long in the making, would like to acknowledge with gratitude the help of many kinds given by the publisher and especially to its Managing  ...  sites like Amazon give us recommendations based on our past purchases.  ... 
doi:10.2307/j.ctt5vjtd9.12 fatcat:kegc3rsth5eydj3r3m257xv67i

Improved scheduling algorithm for signal processing in asynchronous distributed ultrasonic total-focusing-method system

Yuzhong Li, Wenming Tang, Guixiong Liu, Shih-Wei Lin
2019 PLoS ONE  
of reading operations among the first-in-first-out memories for signal processing and minimal time-slot waiting.  ...  scheduling algorithm called "the sum of start time and processing time adjacent (SSPA) algorithm" is presented.  ...  The FCFS algorithm is dispatched to the current free SPM, according to the order of task arrival.  ... 
doi:10.1371/journal.pone.0212285 pmid:30763380 pmcid:PMC6375623 fatcat:7ergbs7jgnfepbovbgcc2wwdiu

An Energy-Efficient Topology Control Algorithm for Earth Building Monitoring Using Heterogeneous Wireless Sensor Networks

Ning Wang, Zhen Hong
2019 IEEE Access  
In this paper, an energy-efficient topology control (EETC) algorithm is proposed for energy saving and load balancing of the network.  ...  so as to permit each cluster has the similar number of the cluster member.  ...  ACKNOWLEDGMENT The authors would like to thank all the anonymous reviewers for spending their time to review and provide suggestions.  ... 
doi:10.1109/access.2019.2921727 fatcat:wkyx4f6m2nbbrni4p4h6thg7y4

A new algorithm for aortic compliance evaluation in normals

Yi Wang, Jianping Zhang, Edwin Estrada, Nathaniel Reichek
2009 Journal of Cardiovascular Magnetic Resonance  
(DT) as defined by the percentage of transmurality in each scar.  ...  For quantitative assessment of infarct morphology late gadolinium enhancement (LGE) was performed including measurement of total and relative infarct mass (related to LV mass) and the degree of transmurality  ...  Conclusion: We presented a robust, accurate and efficient method for the fully automatic delineation of the myocardium contours in LA + SA cine CMR images, which can be used for accurate LV functional  ... 
doi:10.1186/1532-429x-11-s1-p284 fatcat:bgtvrt2tyzhcpit4qnbbou3nji

Interrupting snapshots and the Java size method

Yehuda Afek, Nir Shavit, Moran Tzafrir
2012 Journal of Parallel and Distributed Computing  
This paper presents a highly scalable wait-free implementation of a concurrent size() operation based on a new lock-free interrupting snapshots algorithm for the classical atomic snapshot problem.  ...  past, to have them coordinate the collecting of a shared global view.  ...  Acknowledgments We thank Dave Dice and Doug Lea for their help during the writing of this paper.  ... 
doi:10.1016/j.jpdc.2012.03.007 fatcat:zsxw5uzryzapba2o3b6ivanotq

A lifetime optimal algorithm for speculative PRE

Jingling Xue, Qiong Cai
2006 ACM Transactions on Architecture and Code Optimization (TACO)  
A lifetime optimal algorithm, called MC-PRE, is presented for the first time that performs speculative PRE based on edge profiles.  ...  optimal algorithm for performing nonspeculative classic PRE), and CMP-PRE (Bodik, Gupta, and Soffa's PRE algorithm based on code-motion preventing (CMP) regions, which is speculative but not computationally  ...  ACKNOWLEDGMENTS We wish to thank the reviewers and editors for their helpful comments and suggestions. This work is partially supported by an ARC grant DP0452623.  ... 
doi:10.1145/1138035.1138036 fatcat:6jxnqgxw6vbzpoefpqlt56pacm

Betting your life on an algorithm

Daniel C. Dennett
1990 Behavioral and Brain Sciences  
ability, Robert Wilensky Division of Computer Science, University of California, Berkeley, Berkeley, CA 94720 Electronic mail: wilensky@larch.berkeley.edu Is the mind algorithmic aloeg the lines of a  ...  tidal distortion), represents the free gravitational field.  ...  The argument works for simple algorithms, but it does not cross the defense line of strong AI, because a more sophisticated software can mimic the ways Penrose thinks human intellect can outwit an algorithm  ... 
doi:10.1017/s0140525x00080742 fatcat:oksxbigvojgmfnrkc73qgp3qmq
« Previous Showing results 1 — 15 out of 6,322 results