Filters








60,503 Hits in 4.2 sec

Tight bounds on parallel list marking [chapter]

Sandeep N. Bhatt, Gianfranco Bilardi, Kieran T. Herley, Geppino Pucci, Abhiram G. Ranade
1995 Lecture Notes in Computer Science  
The list marking problem involves marking the nodes of an'-node linked list stored in the memory of a (p; n)-PRAM, when only the position of the head of the list is initially known, while the remaining  ...  For the case where list cells are tagged in a way that di erentiates them from other cells, the above lower bound still applies to deterministic algorithms, while we establish a tight min n';'= p + q (  ...  Acknowledgments The authors wish to thank the referees of EUROPAR'95 for their valuable feedback on the conference version of the paper, which resulted in improvements of the manuscript. This  ... 
doi:10.1007/bfb0020468 fatcat:iaayjygsfvhjriwlzmaxblkv64

Parallel bounded analysis in code with rich invariants by refinement of field bounds

Nicolás Rosner, Juan Galeotti, Santiago Bermúdez, Guido Marucci Blas, Santiago Perez De Rosso, Lucas Pizzagalli, Luciano Zemín, Marcelo F. Frias
2013 Proceedings of the 2013 International Symposium on Software Testing and Analysis - ISSTA 2013  
In this article we present a novel technique for automated parallel bug-finding based on the sequential analysis tool TACO.  ...  TACO is a tool based on SAT-solving for efficient bugfinding in Java code with rich class invariants.  ...  Sequential analyses, such as those using TACO after computing tight bounds in parallel, were run on a single dedicated CeCAR node.  ... 
doi:10.1145/2483760.2483770 dblp:conf/issta/RosnerGBBRPZF13 fatcat:u5trj4i3jbbzljpclfvy6ldr7m

Constraint-based search for optimal Golomb rulers

M. M. A. Polash, M. A. H. Newton, A. Sattar
2017 Journal of Heuristics  
In this paper, we provide tight upper bounds for Golomb ruler marks and present heuristic-based effective domain reduction techniques.  ...  In this paper, we provide tight upper bounds for Golomb ruler marks and present heuristic-based effective domain reduction techniques.  ...  Since the domain reduction approach imposes certain bounds on some marks other than the middle marks, after reduction, the bounds become narrower than those obtained by the tight bound technique.  ... 
doi:10.1007/s10732-017-9353-x fatcat:63mituu62nd7zcaytibum7ziv4

Concurrent, parallel, real-time garbage-collection

Fridtjof Siebert
2010 Proceedings of the 2010 international symposium on Memory management - ISMM '10  
In a real-time system, however, guarantees on the GC's performance in the worst case are required.  ...  Parallel means that an arbitrary number of CPUs may perform GC work in parallel, while concurrent means that the GC work can be performed concurrently to the application code without preempting the application  ...  The author is not aware of any other concurrent and parallel GC that provides a similarly tight bound on the amount of GC work that guarantees finishing a complete cycle.  ... 
doi:10.1145/1806651.1806654 dblp:conf/iwmm/Siebert10 fatcat:lsl7luspbfddrf6vkfrvgyuh7m

The Dispersion Time of Random Walks on Finite Graphs

Nicolás Rivera, Thomas Sauerwald, Alexandre Stauffer, John Sylvester
2019 The 31st ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA '19  
Most of our bounds are tight up to a multiplicative constant. CCS CONCEPTS • Theory of computation → Random walks and Markov chains.  ...  This coupling also gives us that dispersion time of Parallel-IDLA is bounded in expectation by dispersion time of the Sequential-IDLA up to a multiplicative log n factor.  ...  In fact for any fixed r < ∞ one can construct a family of r -regular graphs for which the second bound above is tight.  ... 
doi:10.1145/3323165.3323204 dblp:conf/spaa/RiveraSSS19 fatcat:ugqwdpa4onaxjpcmad6s47kozi

Optimizing the Four-Index Integral Transform Using Data Movement Lower Bounds Analysis

Samyam Rajbhandari, Fabrice Rastello, Karol Kowalski, Sriram Krishnamoorthy, P. Sadayappan
2017 Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '17  
It transforms a four-dimensional tensor from one basis to another.  ...  We develop a novel approach to address this problem, using lower bounds modeling of data movement complexity.  ...  Acess to parallel computer resources at the Ohio Supercomputer Center, CSE Department at Ohio State University, and Pacific Northwest national Laboratory are gratefully acknowledged.  ... 
doi:10.1145/3018743.3018771 fatcat:m6sn57jhgvdthmbmzxdyxq3bbe

Optimizing the Four-Index Integral Transform Using Data Movement Lower Bounds Analysis

Samyam Rajbhandari, Fabrice Rastello, Karol Kowalski, Sriram Krishnamoorthy, P. Sadayappan
2017 SIGPLAN notices  
It transforms a four-dimensional tensor from one basis to another.  ...  We develop a novel approach to address this problem, using lower bounds modeling of data movement complexity.  ...  Acess to parallel computer resources at the Ohio Supercomputer Center, CSE Department at Ohio State University, and Pacific Northwest national Laboratory are gratefully acknowledged.  ... 
doi:10.1145/3155284.3018771 fatcat:4hlj5kah5jhdhj2bjwlns6vdqu

Page 6198 of Mathematical Reviews Vol. , Issue 95j [page]

1995 Mathematical Reviews  
Seiferas and Ju Zhang, A tight lower bound for on-line monotonic list labeling (131-142); Stefan Felsner, Rudolf Miiller and Lorenz Wernisch, Trapezoid graphs and generalizations, geometry and algorithms  ...  B-trees (49-60); Mark de Berg, Marko de Groot and Mark Overmars, New results on binary space partitions in the plane (extended abstract) (61-72); Piotr Berman and Andrzej Lingas, A nearly optimal parallel  ... 

Processor-Oblivious Record and Replay

Robert Utterback, Kunal Agrawal, I-Ting Angelina Lee, Milind Kulkarni
2017 Proceedings of the 22nd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP '17  
We provide theoretical guarantees for our record and replay scheme -namely that record is optimal for programs with one lock and replay is near-optimal for all cases.  ...  Record-and-replay systems are useful tools for debugging non-deterministic parallel programs by first recording an execution and then replaying that execution to produce the same access pattern.  ...  For a single lock, note that W/P , S, and B are all lower bounds on the execution on P workers; therefore, the bound is tight.  ... 
doi:10.1145/3018743.3018764 fatcat:xlnlu7fmjrbz5avz37yejqq4lq

Efficient geodesics and an effective algorithm for distance in the complex of curves [article]

Joan Birman, Dan Margalit, William Menasco
2015 arXiv   pre-print
Our method gives a new preferred finite set of geodesics between any two vertices of the complex, called efficient geodesics, which are different from the tight geodesics introduced by Masur and Minsky  ...  the problem of constructing geodesics that are not tight.  ...  are especially grateful to John Hempel for sharing with us his algorithm, to Richard Webb for sharing many ideas and details of his work, and to Tarik Aougab for many insightful comments, especially on  ... 
arXiv:1408.4133v2 fatcat:biufl2hlvfdxrne3z2fmf7mlme

Perfectly Secure Oblivious Parallel RAM with O(log 3 N/ log log N) Overhead [article]

T.-H. Hubert Chan, Wei-Kai Lin, Kartik Nayak, Elaine Shi
2020 IACR Cryptology ePrint Archive  
., one whose access patterns do not leak information about the secret inputs. Similarly, Oblivious Parallel RAM (OPRAM) compiles a parallel RAM program to an oblivious counterpart.  ...  supported by NSF CNS-1601879, an ONR YIP award, and a Packard Fellowship. § Wei-Kai Lin was supported by a DARPA Brandeis award. ¶ Kartik Nayak was partially supported by NSF Award 2016393. 1 For the parallel  ...  [AKL + 20a] and parallel tight compaction (Theorem 3.6): Corollary 3.9 (Naïve parallel Intersperse).  ... 
dblp:journals/iacr/ChanLNS20 fatcat:6a427rcl6bgofpgz5cy5mv5t7q

List scheduling in the presence of branches A theoretical evaluation

Franco Gasperoni, Uwe Schwiegelshohn
1998 Theoretical Computer Science  
Finally, we show that there are branching task systems for which this bound is almost tight. @ 1998-Elevier Science B.V. All rights reserved  ...  Then, we apply a list scheduling algorithm to these systems and derive a worst-case-performance guarantee for this method.  ...  If Tightness of the bound In this section we show that the bound of Theorem 6 is almost tight.  ... 
doi:10.1016/s0304-3975(97)00207-7 fatcat:trot2dlmgvdqtp3bzeq6iuwoii

Efficient Bounded Model Checking of Heap-Manipulating Programs using Tight Field Bounds [chapter]

Pablo Ponzio, Ariel Godio, Nicolás Rosner, Marcelo Arroyo, Nazareno Aguirre, Marcelo F. Frias
2021 Lecture Notes in Computer Science  
Precomputing the relational bounds is a challenging costly task too, for which we also present an efficient algorithm, based on incremental SAT solving.We implement our approach on top of the bounded model  ...  AbstractSoftware model checkers are able to exhaustively explore different bounded program executions arising from various sources of non-determinism.  ...  A timeout (TO) is set at 18,000 seconds (5 hours), for tight bounds computation. Our bottom up tight field bounds technique is non-parallel, and was run on a single workstation.  ... 
doi:10.1007/978-3-030-71500-7_11 fatcat:7mpt2oidxzdsncwteajoyg7sfu

Embeddability in the 3-sphere is decidable [article]

Jiří Matoušek, Eric Sedgwick, Martin Tancer, Uli Wagner
2014 arXiv   pre-print
., an essential curve in the boundary of X bounding a disk in S^3∖ X with length bounded by a computable function of the number of tetrahedra of X.  ...  We further thank Tony Huynh for kind answers to our questions, Helena Nyklová for help with many pictures, and Isaac Mabillard for remarks on a preliminary write-up of the algorithm for EMBED 3→3 .  ...  We conclude by showing that τ bounds a half disk when σ bounds a half disk and A is a boundary parallel annulus (assumed to have tight boundary).  ... 
arXiv:1402.0815v2 fatcat:b63l67yc3zhodolvctcm7dhmry

On Computing the Subset Graph of a Collection of Sets

Paul Pritchard
1999 Journal of Algorithms  
This paper establishes a matching upper bound on the number of edges in a subset graph, shows that the known bound on Yellin and Jutla's algorithm is tight, presents a simple implementation requiring O  ...  (1) bit-parallel operations per ADT operation, and presents a variant of the algorithm with an implementation requiring O(N 2 = log N) RAM operations.  ...  Acknowledgment The work reported herein commenced while the author was on sabbatical leave at the Department of Computer Science at the University of Edinburgh.  ... 
doi:10.1006/jagm.1999.1032 fatcat:qngjbkidifas7dzn3i6e3l4diq
« Previous Showing results 1 — 15 out of 60,503 results