Filters








1,414 Hits in 3.8 sec

Reordering buffer management with advice

Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
2016 Journal of Scheduling  
We consider the problem in the setting of online computation with advice. In this model, the color of an item becomes known only at the time when the item enters the reordering buffer.  ...  In the reordering buffer management problem, a sequence of colored items arrives at a service station to be processed. Each color change between two consecutively processed items generates cost.  ...  For any ε > 0, there is a (1 + ε)-competitive algorithm for the reordering buffer management problem which uses only O(log(1/ε)) advice bits per input item.  ... 
doi:10.1007/s10951-016-0487-8 fatcat:je2l74eqmbdizfn3e7kzzsvuri

Reordering Buffer Management with Advice [chapter]

Anna Adamaszek, Marc P. Renault, Adi Rosén, Rob van Stee
2014 Lecture Notes in Computer Science  
We consider the problem in the setting of online computation with advice. In this model, the color of an item becomes known only at the time when the item enters the reordering buffer.  ...  In the reordering buffer management problem, a sequence of colored items arrives at a service station to be processed. Each color change between two consecutively processed items generates cost.  ...  For any ε > 0, there is a (1 + ε)-competitive algorithm for the reordering buffer management problem which uses only O(log(1/ε)) advice bits per input item.  ... 
doi:10.1007/978-3-319-08001-7_12 fatcat:etrnbo4gfrfp3bguwkmcvtwa5e

An Algorithm for Reordering Buffer Management Problem and Experimental Evaluations on Discrete Distributions [article]

Gözde Filiz, M. Oğuzhan Külekci
2021 arXiv   pre-print
In the reordering buffer management problem, a sequence of requests must be executed by a service station, where a cost occurs for each pair of consecutive requests with different attributes.  ...  A reordering buffer management algorithm aims to permute the input sequence using the buffer to minimize the total cost.  ...  A simple process with buffer management strategy.  ... 
arXiv:2105.10689v1 fatcat:bdyai5c2x5hybgk6xj4araowuu

The garbage collection advantage

Xianglong Huang, Stephen M. Blackburn, Kathryn S. McKinley, J Eliot B. Moss, Zhenlin Wang, Perry Cheng
2004 SIGPLAN notices  
At garbage collection time, the OOR collector then copies referents of hot fields together with their parent.  ...  The overhead of OOR is on average negligible and always less than 2% on Java benchmarks in Jikes RVM with MMTk.  ...  s field reordering depends on profiling to generate reordering advice [7] . The programmer then follows the advice to rewrite the code and reorder fields.  ... 
doi:10.1145/1035292.1028983 fatcat:6czk6zohybgqhlwj7l55dphkdu

The garbage collection advantage

Xianglong Huang, Stephen M. Blackburn, Kathryn S. McKinley, J Eliot B. Moss, Zhenlin Wang, Perry Cheng
2004 Proceedings of the 19th annual ACM SIGPLAN Conference on Object-oriented programming, systems, languages, and applications - OOPSLA '04  
At garbage collection time, the OOR collector then copies referents of hot fields together with their parent.  ...  The overhead of OOR is on average negligible and always less than 2% on Java benchmarks in Jikes RVM with MMTk.  ...  s field reordering depends on profiling to generate reordering advice [7] . The programmer then follows the advice to rewrite the code and reorder fields.  ... 
doi:10.1145/1028976.1028983 dblp:conf/oopsla/HuangBMMWC04 fatcat:m4fmg25l7jevthgtakpijq7t6e

Business process innovation in the supply chain – a case study of implementing vendor managed inventory

Jan Holmström
1998 European Journal of Purchasing & Supply Management  
In the Nordic countries vendor managed inventory (VMI) is an example of a new way of doing business that can give pioneers a competitive edge.  ...  The vendor in this case is the first supplier to go into a full-scale VMI relationship with the wholesalerand has, through this, substantially reduced delivery costs to the retail trade.  ...  Increased reorder levels are then adjusted monthly in cooperation with the key customer supply clerk. The work for the logistics managers has also changed.  ... 
doi:10.1016/s0969-7012(97)00028-2 fatcat:wflujqg7w5gixcwahy62xs2niy

Book Review: The Financial Diaries

Barbara O'Neill
2018 Journal of Financial Therapy  
Morduch and Schneider note that "volatility wreaks havoc with all the standard advice on how to manage finances.  ...  One didn't reorder checks to avoid being trapped by payday lenders.  ... 
doi:10.4148/1944-9771.1180 fatcat:qioreg5fmvbe7fiyhq7omieksm

Multipath aggregation of heterogeneous access networks

Dominik Kaspar
2012 ACM SIGMultimedia Records  
With her farsight and management skills, Eunah always kept me focussed and fuelled my motivation when things did not go as planned.  ...  There are many people that gave me good advice during my studies. Knut-Helge Vik often encouraged me with helpful tips from his own doctoral studies.  ...  Reorder Buffer Occupancy Density Applications that require ordered data delivery often use a reorder buffer to recover from packet reordering by placing arriving packets with a sequence number greater  ... 
doi:10.1145/2206765.2206770 fatcat:4a5xgn5hhnfbzkosk57rwguiri

Low-power option Greeks: Efficiency-driven market risk analysis using FPGAs [article]

Mark Klaisoongnoen, Nick Brown, Oliver Thomson Brown
2022 arXiv   pre-print
Technology Analysis Center's (STAC) derivatives risk analysis benchmark STAC-A2™ by porting the Heston stochastic volatility model and Longstaff and Schwartz path reduction onto a Xilinx Alveo U280 FPGA with  ...  ACKNOWLEDGMENTS The authors would like to thank STAC for access to the STAC-A2 benchmark and for their advice and assistance.  ...  second buffer.  ... 
arXiv:2206.03719v1 fatcat:mezhk2qiyzamtg5lowun2zsbya

Automatic inference of memory fences

Michael Kuperstein, Martin Vechev, Eran Yahav
2012 ACM SIGACT News  
Modern architectures implement relaxed memory models which may reorder memory operations or execute them nonatomically.  ...  ACKNOWLEDGEMENTS We would like to thank Maged Michael for his valuable comments and advice during the preparation of this paper.  ...  This will allow us to avoid bounding the execution buffer and make our algorithm more suitable for more general input programs. VIII.  ... 
doi:10.1145/2261417.2261438 fatcat:7br5fihidndbjmvltt2amhpxxq

Using System Dynamics to assess the impact of RFID technology on retail operations

Alberto De Marco, Anna C. Cagliano, Mauro L. Nervo, Carlo Rafele
2012 International Journal of Production Economics  
Acknowledgements This study is part of the Miroglio's SC reengineering project with the involvement of the  ...  In addition, to enhance fidelity to the brand, store managers and sales assistants are committed to deliver experienced and personalized advice to customers.  ...  'items on shipper's buffer') with the purpose of eliminating, as in real-case, Saturday afternoons' and Sundays' shipments so that Friday shipments are simulated to arrive early the next week.  ... 
doi:10.1016/j.ijpe.2011.08.009 fatcat:y66fme3hgbdk7ldhx77zlq62fu

Interfacing network coding with TCP: an implementation [article]

Jay Kumar Sundararajan, Szymon Jakubczak, Muriel Medard, Michael Mitzenmacher, Joao Barros
2009 arXiv   pre-print
In this paper we present a real-world implementation of this protocol that addresses several important practical aspects of incorporating network coding and decoding with TCP's window management mechanism  ...  Further, we work with the more widespread and practical TCP Reno.  ...  We would also like to thank Mythili Vutukuru and Rahul Hariharan for their help and advice regarding the implementation.  ... 
arXiv:0908.1564v1 fatcat:k4lzt46mona5rnhtturilpkf4u

Interactions and Equilibrium Between Rescheduling Train Traffic and Routing Passengers in Microscopic Delay Management: A Game Theoretical Study

Francesco Corman
2020 Transportation Science  
management • train scheduling and routing • passenger routing and route choice • game theory • passenger assignment • route choice and information  ...  In the computational experiments, we deal with timetable disturbances, that is, with entrance delays that can be managed without the need for train cancelations.  ...  with with advice + advice + group average group average 38.1 30.8 26.1 32.1 309.7 277.1 33.4 52.8 28.1 41.3 25.3 32.2 295.1 256.8 51.5 70.6 29.6 36.7 25.0 32.5 294.1 260.2 51.3 70.6 29.9 34.0 23.8 30.2  ... 
doi:10.1287/trsc.2020.0979 fatcat:fwqgmee4cng67ecf5cvyhkv764

Randomization can be as helpful as a glimpse of the future in online computation [article]

Jesper W. Mikkelsen
2016 arXiv   pre-print
We provide simple but surprisingly useful direct product theorems for proving lower bounds on online algorithms with a limited amount of advice about the future.  ...  This means that several long-standing open questions regarding randomized online algorithms can be equivalently stated as questions regarding online algorithms with sublinear advice.  ...  Reordering buffer management It is easy to show that the reordering buffer management problem with a buffer of size k is Σrepeatable (see Lemma 16) .  ... 
arXiv:1511.05886v2 fatcat:jt53qnuuqzgolmplyravo3r2ui

Evaluation of QoS differentiation mechanisms in asynchronous bufferless optical packet-switched networks

H. Overby, N. Stol, M. Nord
2006 IEEE Communications Magazine  
Existing quality of service differentiation schemes for today's IP over point-to-point optical WDM networks take advantage of electronic RAM to implement traffic management algorithms in order to isolate  ...  ACKNOWLEDGMENTS The authors wish to thank Telenor R&D and the Department of Telematics for supporting this work, and Andreas Kimsås at the Department of Telematics for valuable advice.  ...  This, combined with the bulkiness and cost introduced by FDLs, limits the capacity of an FDL buffer.  ... 
doi:10.1109/mcom.2006.1678109 fatcat:sunkpugytnhplicfhebficrqsa
« Previous Showing results 1 — 15 out of 1,414 results