Filters








315 Hits in 7.1 sec

Page 7537 of Mathematical Reviews Vol. , Issue 2002J [page]

2002 Mathematical Reviews  
[Kaplan, Haim] (1L-TLAY; Tel Aviv Caching documents with variable sizes and fetching costs: an LP-based approach. (English summary) Algorithmica 32 (2002), no. 3, 459-466.  ...  Summary: “We give an integer programming formulation of the paging problem with varying sizes and fetching costs.  ... 

Certifying and Reasoning on Cost Annotations in C Programs [chapter]

Nicolas Ayache, Roberto M. Amadio, Yann Régis-Gianas
2012 Lecture Notes in Computer Science  
with respect to an execution cost model of the object code.  ...  To that end, we report our successful experience in implementing and testing the labelling approach on top of a prototype compiler written in ocaml for (a large fragment of) the C language.  ...  with respect to the cost variable.  ... 
doi:10.1007/978-3-642-32469-7_3 fatcat:wb7mlsz53nfcli3eggynspnfea

ML for ML: Learning Cost Semantics by Experiment [chapter]

Ankush Das, Jan Hoffmann
2017 Lecture Notes in Computer Science  
It is an open problem in static resource bound analysis to connect high-level resource bounds with the actual execution time and memory usage of compiled machine code.  ...  To learn the constants for a specific hardware, a machine learning algorithm measures the resource cost of a set of training programs and compares the cost with the prediction of the cost semantics.  ...  The size of the major heap is variable, hence, modeling the major heap is an important and complicated problem.  ... 
doi:10.1007/978-3-662-54577-5_11 fatcat:ndiuvlejgfdzlbe26dqo5eakdi

Approximate parallel simulation of web search engines

Mauricio Marin, Veronica Gil-Costa, Carolina Bonacic, Roberto Solar
2013 Proceedings of the 2013 ACM SIGSIM conference on Principles of advanced discrete simulation - SIGSIM-PADS '13  
These simulators must be fast, memory efficient and parallel to cope with the execution of millions of events in small running time on few processors.  ...  Performance is fully dependent on users behavior which is featured by unpredictable and drastic variations in trending topics and arrival rate intensity.  ...  If not found, a cache line sized piece of the data is transfered from main memory to cache L2 at cost g2, and then from L2 to L1 at cost g1.  ... 
doi:10.1145/2486092.2486116 dblp:conf/pads/MarinCBS13 fatcat:2d2yb2vjovagrespdg2pw2yidm

Efficient query processing in distributed search engines

Simon Jonassen
2012 SIGIR Forum  
For the second approach, we follow an alternative direction and look at document-at-a-time processing of sub-queries and skipping.  ...  Third, we elaborate on caching in Web search engines in two independent contributions. First, we present an analytical model that finds the optimal split in a static memory-based two-level cache.  ...  Rocha-Junior for the useful advices and comments on the paper. Acknowledgments. This work was done while the second author was an intern at Yahoo!  ... 
doi:10.1145/2492189.2492201 fatcat:uwasxhngrfgntemkhawyv3te64

Caching under Content Freshness Constraints [article]

Pawan Poojary, Sharayu Moharir, Krishna Jagannathan
2017 arXiv   pre-print
We then analytically obtain the content-wise hit-rates for the Least Popular (LP) policy and provide sufficient conditions for the asymptotic optimality of cache performance under this policy.  ...  We corroborate our analytical insights with extensive simulations.  ...  For a system consisting of n objects with cache-size M(n) and freshness parameter F (n), if M(n) = ω(1) and F (n) = ω(1), then lim n→∞ P LP (hit) = 1.  ... 
arXiv:1712.10041v1 fatcat:2qkejaxvunc7liijm5y67mdimu

On the optimization of storage capacity allocation for content distribution

Nikolaos Laoutaris, Vassilios Zissimopoulos, Ioannis Stavrakakis
2005 Computer Networks  
An innovative aspect of the presented approach is that it combines all relevant subproblems, concerning node locations, node sizes, and object placement, and solves them jointly in a single optimization  ...  In addition to reducing the average fetch distance for the requested content, they also cater to load balancing and workload constraints on a given node.  ...  cost function and the complexity analysis of the heuristic algorithms.  ... 
doi:10.1016/j.comnet.2004.07.020 fatcat:a3y5kojograqvpr36xsdvnygbe

Performance of multiuser network-aware prefetching in heterogeneous wireless systems

Ben Liang, Stephen Drew, Da Wang
2007 Wireless networks  
However, an undesirable effect of multiple prefetching users is the potential for system instability due to the racing behavior between the document access delay and the user prefetching quantity.  ...  We further demonstrate that stability can be maintained even under heavy usage, providing both the same scalability as a non-prefetching system and the performance gain associated with prefetching.  ...  Then, the prefetching threshold for an individual user is based on a decision function that compares the expected costs of requesting and not requesting to prefetch a document with access probability p  ... 
doi:10.1007/s11276-007-0027-8 fatcat:57ogy6dyp5cune4ahv6vtd56ae

WCET analysis for a Java processor

Martin Schoeberl, Rasmus Pedersen
2006 Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems - JTRES '06  
A method cache, that fills whole Java methods into the cache, is analyzable with respect to the WCET. The WCET analysis tool is based on integer linear programming.  ...  The tool performs the low-level analysis at the bytecode level and integrates the method cache analysis for a two block cache.  ...  Acknowledgment The authors thank Peter Puschner for the discussion on ILP based WCET analysis and his constructive comments on early versions of the paper.  ... 
doi:10.1145/1167999.1168033 fatcat:dr2t43ejgre57newy5fep45tsu

Synchronised Range Queries

Vinoth Suryanarayanan, Rob Minson, Georgios K. Theodoropoulus
2009 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications  
Simulations play a key role for the designer of an agent based system to experiment and study the impact of different architectures, environment and agent behaviour.  ...  Based on this approach, PDES-MAS (Parallel and Discrete Event Simulations for Multi-Agent System) framework is designed to execute large scale models such as MAS.  ...  ACKNOWLEDGEMENTS I firstly need to thank my supervisor Dr.Georgios Theodoropoulos who has been very supportive and patient with my research and always kind and helpful whenever I needed.  ... 
doi:10.1109/ds-rt.2009.31 dblp:conf/dsrt/SuryanarayananMT09 fatcat:moufqpoyajhrjnwmd55cjopmte

Cost-Efficient Global Robot Navigation in Rugged Off-Road Terrain

T. Braun
2011 Künstliche Intelligenz  
, but also cost-efficient, e.g. able to generate navigation paths which optimize a cost measure closely related to terrain traversability.  ...  Furthermore, I'd like to thank Rita Broschart for dealing with the administrative chaos that we generated with our many trips to different conferences and various other institutions.  ...  The coarsest method builds a global cost model, the second technique constructs a local model and the third approach predicts costs based solely an edge's direct inverse twin.  ... 
doi:10.1007/s13218-011-0088-9 fatcat:u4ssainmcvc3jmqdon6gpjg674

Efficient search in large textual collections with redundancy

Jiangong Zhang, Torsten Suel
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
Our approach results in significant reductions in index size and query processing costs on such collections, and it is orthogonal to and can be combined with the existing techniques.  ...  Since the data size of such an archive is multiple times that of a single snapshot, this presents us with significant performance challenges.  ...  In Table 6 .1, we compare the resulting index sizes for a standard index, an index with local sharing, and an index with global sharing.  ... 
doi:10.1145/1242572.1242628 dblp:conf/www/ZhangS07 fatcat:6y2lt2heqjh7zf54vv6hmy7pqu

Rover

A. D. Joseph, A. F. de Lespinasse, J. A. Tauber, D. K. Gifford, M. F. Kaashoek
1995 Proceedings of the fifteenth ACM symposium on Operating systems principles - SOSP '95  
A relocatable dynamic object is an object with a well-defined interface that can be dynamically loaded into a client computer from a server computer (or vice versa) to reduce clientserver communication  ...  The Rover toolkit provides mobile communication support based on two ideas: relocatable dynamic objects (RDOS) and queued remote procedure call (QRPC).  ...  We would also like to thank Michael Shurpik and Sanjay Ghemawat for helping with the development of Rover and Webcal.  ... 
doi:10.1145/224056.224069 dblp:conf/sosp/JosephdTGK95 fatcat:wecofnbpy5hqxjhi763dmj2nwu

Rover

A. D. Joseph, A. F. de Lespinasse, J. A. Tauber, D. K. Gifford, M. F. Kaashoek
1995 ACM SIGOPS Operating Systems Review  
A relocatable dynamic object is an object with a well-defined interface that can be dynamically loaded into a client computer from a server computer (or vice versa) to reduce clientserver communication  ...  The Rover toolkit provides mobile communication support based on two ideas: relocatable dynamic objects (RDOS) and queued remote procedure call (QRPC).  ...  We would also like to thank Michael Shurpik and Sanjay Ghemawat for helping with the development of Rover and Webcal.  ... 
doi:10.1145/224057.224069 fatcat:6ndb2a7isjaprd5hht7e6jec7i

DimmWitted: A Study of Main-Memory Statistical Analytics [article]

Ce Zhang, Christopher Ré
2014 arXiv   pre-print
We study this new tradeoff space, and discover there are tradeoffs between hardware and statistical efficiency.  ...  Our goal is to understand tradeoffs in accessing the data in row- or column-order and at what granularity one should share the model and data for a statistical task.  ...  Acknowledgments We would like to thank Arun Kumar, Victor Bittorf, the Delite team, the Advanced Analytics at Oracle, Greenplum/Pivotal, and Impala's Cloudera team for sharing their experiences in building  ... 
arXiv:1403.7550v3 fatcat:vpi4teblxnf4zbwuruwjkluopy
« Previous Showing results 1 — 15 out of 315 results