Filters








2,032 Hits in 10.2 sec

The Limits of Buffering: A Tight Lower Bound for Dynamic Membership in the External Memory Model

Elad Verbin, Qin Zhang
2013 SIAM journal on computing (Print)  
This lower bound answers a folklore conjecture of the external memory community.  ...  The lower bound has some striking implications for external memory data structures.  ...  The authors would like to thank Mihai Pǎtraşcu, Ke Yi and Zeyuan Allen Zhu for helpful discussions. We would like to thank the STOC and SICOMP anonymous reviewers for their insightful reviews.  ... 
doi:10.1137/110842211 fatcat:dgq3z66hi5ev7mohdhd523okje

The limits of buffering

Elad Verbin, Qin Zhang
2010 Proceedings of the 42nd ACM symposium on Theory of computing - STOC '10  
This lower bound answers a folklore conjecture of the external memory community.  ...  The lower bound has some striking implications for external memory data structures.  ...  The authors would like to thank Mihai Pǎtraşcu, Ke Yi and Zeyuan Allen Zhu for helpful discussions. We would like to thank the STOC and SICOMP anonymous reviewers for their insightful reviews.  ... 
doi:10.1145/1806689.1806752 dblp:conf/stoc/VerbinZ10 fatcat:qtxnv2n47jfphfdop3ogltdsza

Accurate Chemical Master Equation Solution Using Multi-Finite Buffers

Youfang Cao, Anna Terebus, Jie Liang
2016 Multiscale Modeling & simulation  
The maximal sizes of the finite buffers for a given error tolerance can also be pre-computed without costly trial solutions of dCMEs.  ...  The discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks.  ...  This is due to the complexity of this MAPK model and the limitation of the 3GB CUDA memory of the GPU processor we used.  ... 
doi:10.1137/15m1034180 pmid:27761104 pmcid:PMC5066912 fatcat:7r4oqyrwcjbkjod2frllds7xse

On The I/O Complexity of Dynamic Distinct Counting

Xiaocheng Hu, Yufei Tao, Yi Yang, Shengyu Zhang, Shuigeng Zhou, Marc Herbstritt
2015 International Conference on Database Theory  
In external memory, the problem admits two standard solutions.  ...  In dynamic distinct counting, we want to maintain a multi-set S of integers under insertions to answer efficiently the query: how many distinct elements are there in S?  ...  The limits of buffering: a tight lower bound for dynamic membership in the external memory model.  ... 
doi:10.4230/lipics.icdt.2015.265 dblp:conf/icdt/HuTYZZ15 fatcat:poi2to4gvnfrjhs6a22tumaira

Using Hashing to Solve the Dictionary Problem (In External Memory) [article]

John Iacono, Mihai Pǎtraşcu
2011 arXiv   pre-print
We consider the dictionary problem in external memory and improve the update time of the well-known buffer tree by roughly a logarithmic factor.  ...  We also present a lower bound in the cell-probe model showing that our data structure is optimal.  ...  On dynamic bit-probe complexity. A Lower Bounds Formally, our model of computation is defined as follows.  ... 
arXiv:1104.2799v1 fatcat:pbflllt6fngntkvv7w4forjtna

Logarithmic Lower Bounds in the Cell-Probe Model [article]

Mihai Patrascu, Erik D. Demaine
2005 arXiv   pre-print
We also prove the first Omega(log_B n) lower bound in the external-memory model without assumptions on the data structure (such as the comparison model).  ...  Such a lower bound breaks a long-standing barrier of Omega(lg n / lglg n) for any dynamic language membership problem.  ...  and for dynamic connectivity in the external-memory model.  ... 
arXiv:cs/0502041v2 fatcat:z2ez6y6qp5fbpiuredfeehzhau

On Dynamic Bit-Probe Complexity [chapter]

Corina E. Pǎtraşcu, Mihai Pǎtraşcu
2005 Lecture Notes in Computer Science  
The present paper does imply such a lower bound, almost matching the bounds achieved by buffer trees, which constitute one of the most important tools for external-memory algorithms.  ...  This work present several advances in the understanding of dynamic data structures in the bit-probe model: • We improve the lower bound record for dynamic language membership problems to Ω(( lg n lg lg  ...  We are grateful to Thore Husfeldt and an anonymous referee for the conference version, for many helpful suggestions in the presentation of the lower bound proof.  ... 
doi:10.1007/11523468_78 fatcat:ughbs254kjg4nayypxctfhmsbu

On dynamic bit-probe complexity

Mihai Paˇtraşcu, Corina E. Tarniţaˇ
2007 Theoretical Computer Science  
We also obtain new lower bounds for the partial-sums problem in the cell-probe and external-memory models.  ...  This work present several advances in the understanding of dynamic data structures in the bit-probe model: • We improve the lower bound record for dynamic language membership problems to Ω (( lg n lg lg  ...  Acknowledgments We are grateful to Thore Husfeldt and an anonymous referee for the conference version, for many helpful suggestions in the presentation of the lower bound proof.  ... 
doi:10.1016/j.tcs.2007.02.058 fatcat:zxafkmoj7vhqbihdth757yb3aa

Logarithmic Lower Bounds in the Cell-Probe Model

Mihai Patrascu, Erik D. Demaine
2006 SIAM journal on computing (Print)  
We can also prove the first Ω(lg B n) lower bound in the external memory model, without assumptions on the data structure.  ...  We present lower bounds for the partial-sums problem and dynamic connectivity, which are tight in almost all cases.  ...  Although bounds of this magnitude are ubiquitous in external memory models, our lower bound is the first that holds in a general model of computation.  ... 
doi:10.1137/s0097539705447256 fatcat:i7j4u2ztk5bfdnpcmmyfhpwnbm

On a model of indexability and its bounds for range queries

Joseph M. Hellerstein, Elias Koutsoupias, Daniel P. Miranker, Christos H. Papadimitriou, Vasilis Samoladas
2002 Journal of the ACM  
By applying this theorem, we show interesting upper and lower bounds and trade-offs between A and r in the case of multidimensional range queries and set queries.  ...  Given a desired access overhead A, there is a minimum redundancy that any indexing scheme must exhibit. We prove a lower-bound theorem for deriving the minimum redundancy.  ...  Conclusions We have presented a new framework for the modeling and study of indexing in external memory.  ... 
doi:10.1145/505241.505244 fatcat:nbzdi457y5cchbufyfi5boixka

Fuzzy flow regulation for Network-on-Chip based chip multiprocessors systems

Yuan Yao, Zhonghai Lu
2014 2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)  
with external memory banks make up a CMP system.  ...  In this thesis, we design a fuzzy flow regulation mechanism for network-onchip based CMPs.  ...  for external memory channel 20 (cycles)  ... 
doi:10.1109/aspdac.2014.6742913 dblp:conf/aspdac/YaoL14 fatcat:jgytr5vsprdpfip2xh5heya36y

Composable specifications for structured shared-memory communication

Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan Grossman
2010 Proceedings of the ACM international conference on Object oriented programming systems languages and applications - OOPSLA '10  
Section 3.1 first gives a simple definition of what it means for one method to communicate to another, in terms of dynamic memory operations.  ...  in the pipeline by enqueueing items in a bounded buffer from which consume later dequeues them: However, since the bounded buffer's size field is both read and written when produce calls enqueue and when  ...  We thank Tom Bergan and Marius Nita for thoughts on modularity, and the SAMPA and WASP groups at the University of Washington for useful discussions.  ... 
doi:10.1145/1869459.1869473 dblp:conf/oopsla/WoodSCG10 fatcat:3va36e2x3nd2ro266hhx35ckeq

Composable specifications for structured shared-memory communication

Benjamin P. Wood, Adrian Sampson, Luis Ceze, Dan Grossman
2010 SIGPLAN notices  
Section 3.1 first gives a simple definition of what it means for one method to communicate to another, in terms of dynamic memory operations.  ...  in the pipeline by enqueueing items in a bounded buffer from which consume later dequeues them: However, since the bounded buffer's size field is both read and written when produce calls enqueue and when  ...  We thank Tom Bergan and Marius Nita for thoughts on modularity, and the SAMPA and WASP groups at the University of Washington for useful discussions.  ... 
doi:10.1145/1932682.1869473 fatcat:ozztz22dlvgurll3osfbccqara

Melange

Anil Madhavapeddy, Alex Ho, Tim Deegan, David Scott, Ripduman Sohan
2007 ACM SIGOPS Operating Systems Review  
Our quantitative analysis shows that the benefits of MPL-generated code overcomes the additional overheads of automatic garbage collection and dynamic bounds checking.  ...  We combine two techniques to eliminate this performance penalty in a practical fashion: strong static typing and generative metaprogramming.  ...  of discussions, reviews and cups of strong coffee with the authors.  ... 
doi:10.1145/1272998.1273009 fatcat:5dux5hot2fec7nxpzq2mocagjq

Melange

Anil Madhavapeddy, Alex Ho, Tim Deegan, David Scott, Ripduman Sohan
2007 Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007 - EuroSys '07  
Our quantitative analysis shows that the benefits of MPL-generated code overcomes the additional overheads of automatic garbage collection and dynamic bounds checking.  ...  We combine two techniques to eliminate this performance penalty in a practical fashion: strong static typing and generative metaprogramming.  ...  of discussions, reviews and cups of strong coffee with the authors.  ... 
doi:10.1145/1272996.1273009 dblp:conf/eurosys/MadhavapeddyHDSS07 fatcat:uecppr7ydjgwlhwtybjqhieydy
« Previous Showing results 1 — 15 out of 2,032 results