iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://dblp.uni-trier.de/pid/98/6095.xml
Jonatha Anselmi
Jonatha Anselmi Bruno Gaujal Louis-Sébastien Rebuffi Learning optimal admission control in partially observable queueing networks. 31-79 2024 October 108 Queueing Syst. Theory Appl. 1 https://doi.org/10.1007/s11134-024-09917-y db/journals/questa/questa108.html#AnselmiGR24 streams/journals/questa
Federica Filippini Jonatha Anselmi Danilo Ardagna Bruno Gaujal A Stochastic Approach for Scheduling AI Training Jobs in GPU-Based Systems. 53-69 2024 January - March 12 IEEE Trans. Cloud Comput. 1 https://doi.org/10.1109/TCC.2023.3336540 db/journals/tcc/tcc12.html#FilippiniAAG24
Jonatha Anselmi Josu Doncel Load Balancing with Job-Size Testing: Performance Improvement or Degradation? 8:1-8:27 2024 June 9 ACM Trans. Model. Perform. Evaluation Comput. Syst. 2 https://doi.org/10.1145/3651154 db/journals/tompecs/tompecs9.html#AnselmiD24
Jonatha Anselmi Asynchronous Load Balancing and Auto-Scaling: Mean-Field Limit and Optimal Design. 2960-2971 2024 August 32 IEEE/ACM Trans. Netw. 4 https://doi.org/10.1109/TNET.2024.3368130 db/journals/ton/ton32.html#Anselmi24 streams/journals/ton
Jonatha Anselmi Josu Doncel Balanced Splitting: A Framework for Achieving Zero-wait in the Multiserver-job Model. 2024 abs/2409.18557 CoRR https://doi.org/10.48550/arXiv.2409.18557 db/journals/corr/corr2409.html#abs-2409-18557 streams/journals/corr
Jonatha Anselmi Bruno Gaujal Louis-Sébastien Rebuffi Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space. 2023 abs/2302.10667 CoRR https://doi.org/10.48550/arXiv.2302.10667 db/journals/corr/corr2302.html#abs-2302-10667
Jonatha Anselmi Josu Doncel Load Balancing with Job-Size Testing: Performance Improvement or Degradation? 2023 abs/2304.00899 CoRR https://doi.org/10.48550/arXiv.2304.00899 db/journals/corr/corr2304.html#abs-2304-00899
Jonatha Anselmi Bruno Gaujal Louis-Sébastien Rebuffi Learning Optimal Admission Control in Partially Observable Queueing Networks. 2023 abs/2308.02391 CoRR https://doi.org/10.48550/arXiv.2308.02391 db/journals/corr/corr2308.html#abs-2308-02391
Jonatha Anselmi Replication vs speculation for load balancing. 389-391 2022 100 Queueing Syst. Theory Appl. 3-4 https://doi.org/10.1007/s11134-022-09809-z db/journals/questa/questa100.html#Anselmi22
Jonatha Anselmi Bruno Gaujal Louis-Sébastien Rebuffi Optimal Speed Profile of a DVFS Processor under Soft Deadlines. 71-72 2022 49 SIGMETRICS Perform. Evaluation Rev. 3 https://doi.org/10.1145/3529113.3529139 db/journals/sigmetrics/sigmetrics49.html#AnselmiGR22
Jonatha Anselmi Neil Walton Stability and Optimization of Speculative Queueing Networks. 911-922 2022 30 IEEE/ACM Trans. Netw. 2 https://doi.org/10.1109/TNET.2021.3128778 db/journals/ton/ton30.html#AnselmiW22
Jonatha Anselmi Bruno Gaujal Energy Optimal Activation of Processors for the Execution of a Single Task with Unknown Size. 65-72 2022 MASCOTS https://doi.org/10.1109/MASCOTS56607.2022.00017 conf/mascots/2022 db/conf/mascots/mascots2022.html#AnselmiG22 Jonatha Anselmi Bruno Gaujal Louis-Sébastien Rebuffi Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space. 2022 conf/nips/2022 NeurIPS http://papers.nips.cc/paper_files/paper/2022/hash/5d2781cc34f459618a9a504761043055-Abstract-Conference.html db/conf/nips/neurips2022.html#AnselmiGR22
Jonatha Anselmi Asynchronous Load Balancing and Auto-scaling: Mean-Field Limit and Optimal Design. 2022 abs/2204.02352 CoRR https://doi.org/10.48550/arXiv.2204.02352 db/journals/corr/corr2204.html#abs-2204-02352
Jonatha Anselmi Bruno Gaujal Louis-Sébastien Rebuffi Optimal speed profile of a DVFS processor under soft deadlines. 102245 2021 152 Perform. Evaluation https://doi.org/10.1016/j.peva.2021.102245 db/journals/pe/pe152.html#AnselmiGR21
Jonatha Anselmi Neil Walton Stability and Optimization of Speculative Queueing Networks. 2021 abs/2104.10426 CoRR https://arxiv.org/abs/2104.10426 db/journals/corr/corr2104.html#abs-2104-10426
Jonatha Anselmi François Dufour Power-of-<i>d</i>-Choices with Memory: Fluid Limit and Optimality. 862-888 2020 45 Math. Oper. Res. 3 https://doi.org/10.1287/moor.2019.1014 db/journals/mor/mor45.html#AnselmiD20
Jonatha Anselmi Combining Size-Based Load Balancing with Round-Robin for Scalable Low Latency. 886-896 2020 31 IEEE Trans. Parallel Distributed Syst. 4 https://doi.org/10.1109/TPDS.2019.2950621 db/journals/tpds/tpds31.html#Anselmi20
Jonatha Anselmi Josu Doncel Asymptotically Optimal Size-Interval Task Assignments. 2422-2433 2019 30 IEEE Trans. Parallel Distributed Syst. 11 https://doi.org/10.1109/TPDS.2019.2920121 db/journals/tpds/tpds30.html#AnselmiD19
Jonatha Anselmi François Dufour Tomás Prieto-Rumeau Computable approximations for average Markov decision processes in continuous time. 571-592 2018 55 J. Appl. Probab. 2 https://doi.org/10.1017/jpr.2018.36 db/journals/jap/jap55.html#AnselmiDP18
Jonatha Anselmi François Dufour Power-of-d-Choices with Memory: Fluid Limit and Optimality. 2018 abs/1802.06566 CoRR http://arxiv.org/abs/1802.06566 db/journals/corr/corr1802.html#abs-1802-06566
Jonatha Anselmi Asymptotically optimal open-loop load balancing. 245-267 2017 87 Queueing Syst. Theory Appl. 3-4 https://doi.org/10.1007/s11134-017-9547-9 db/journals/questa/questa87.html#Anselmi17
Jonatha Anselmi Danilo Ardagna John C. S. Lui Adam Wierman Yunjian Xu Zichao Yang The Economics of the Cloud. 18:1-18:23 2017 2 ACM Trans. Model. Perform. Evaluation Comput. Syst. 4 https://doi.org/10.1145/3086574 db/journals/tompecs/tompecs2.html#AnselmiALWXY17
Huilong Zhang François Dufour Jonatha Anselmi Dann Laneuville Adrien Negre Piecewise optimal trajectories of observer for bearings-only tracking by quantization. 1-7 2017 FUSION https://doi.org/10.23919/ICIF.2017.8009824 conf/fusion/2017 db/conf/fusion/fusion2017.html#ZhangDALN17
Jonatha Anselmi Neil Walton Decentralized Proportional Load Balancing. 391-410 2016 76 SIAM J. Appl. Math. 1 https://doi.org/10.1137/140969361 db/journals/siamam/siamam76.html#AnselmiW16
Jonatha Anselmi Danilo Ardagna Mauro Passacantando Generalized Nash equilibria for SaaS/PaaS Clouds. 326-339 2014 236 Eur. J. Oper. Res. 1 https://doi.org/10.1016/j.ejor.2013.12.007 https://www.wikidata.org/entity/Q58097216 db/journals/eor/eor236.html#AnselmiAP14
Jonatha Anselmi Bruno Gaujal Efficiency of simulation in monotone hyper-stable queueing networks. 51-72 2014 76 Queueing Syst. Theory Appl. 1 https://doi.org/10.1007/s11134-013-9357-7 db/journals/questa/questa76.html#AnselmiG14
Jonatha Anselmi Danilo Ardagna John C. S. Lui Adam Wierman Yunjian Xu Zichao Yang The economics of the cloud: price competition and congestion. 58-63 2014 13 SIGecom Exch. 1 https://doi.org/10.1145/2692375.2692380 db/journals/sigecom/sigecom13.html#AnselmiALWXY14
Jonatha Anselmi Danilo Ardagna John C. S. Lui Adam Wierman Yunjian Xu Zichao Yang The economics of the cloud: price competition and congestion. 47-49 2014 41 SIGMETRICS Perform. Evaluation Rev. 4 https://doi.org/10.1145/2627534.2627549 db/journals/sigmetrics/sigmetrics41.html#AnselmiALWXY14
Jonatha Anselmi Bruno Gaujal Tommaso Nesti Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies. 2014 abs/1404.4547 CoRR http://arxiv.org/abs/1404.4547 db/journals/corr/corr1404.html#AnselmiGN14
Jonatha Anselmi Bernardo D'Auria Neil Walton Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence. 469-491 2013 38 Math. Oper. Res. 3 https://doi.org/10.1287/moor.1120.0583 db/journals/mor/mor38.html#AnselmiDW13
Jonatha Anselmi Giuliano Casale Heavy-traffic revenue maximization in parallel multiclass queues. 806-821 2013 70 Perform. Evaluation 10 https://doi.org/10.1016/j.peva.2013.08.008 db/journals/pe/pe70.html#AnselmiC13
Jonatha Anselmi Urtzi Ayesta Adam Wierman Competition yields efficiency in load balancing games. 986-1001 2011 68 Perform. Evaluation 11 https://doi.org/10.1016/j.peva.2011.07.005 db/journals/pe/pe68.html#AnselmiAW11
Jonatha Anselmi Ina Maria Verloop Energy-aware capacity scaling in virtualized environments with performance guarantees. 1207-1221 2011 68 Perform. Evaluation 11 https://doi.org/10.1016/j.peva.2011.07.004 db/journals/pe/pe68.html#AnselmiV11
Jonatha Anselmi Bruno Gaujal The price of forgetting in parallel and non-observable queues. 1291-1311 2011 68 Perform. Evaluation 12 https://doi.org/10.1016/j.peva.2011.07.023 db/journals/pe/pe68.html#AnselmiG11
Jonatha Anselmi Bruno Gaujal On the efficiency of perfect simulation in monotone queueing networks. 56-58 2011 39 SIGMETRICS Perform. Evaluation Rev. 2 https://doi.org/10.1145/2034832.2034847 db/journals/sigmetrics/sigmetrics39.html#AnselmiG11
Jonatha Anselmi Paolo Cremonesi A unified framework for the bottleneck analysis of multiclass queueing networks. 218-234 2010 67 Perform. Evaluation 4 https://doi.org/10.1016/j.peva.2009.09.002 db/journals/pe/pe67.html#AnselmiC10
Jonatha Anselmi Bruno Gaujal The price of anarchy in parallel queues revisited. 353-354 2010 SIGMETRICS https://doi.org/10.1145/1811039.1811083 https://doi.org/10.1145/1811099.1811083 conf/sigmetrics/2010 db/conf/sigmetrics/sigmetrics2010.html#AnselmiG10 Jonatha Anselmi Bruno Gaujal Optimal routing in parallel, non-observable queues and the price of anarchy revisited. 1-8 2010 ITC https://doi.org/10.1109/ITC.2010.5608745 conf/teletraffic/2010 db/conf/teletraffic/itc2010.html#AnselmiG10
Jonatha Anselmi Yingdong Lu Mayank Sharma Mark S. Squillante Improved approximations for the Erlang loss model. 217-239 2009 63 Queueing Syst. Theory Appl. 1-4 https://doi.org/10.1007/s11134-009-9117-x db/journals/questa/questa63.html#AnselmiLSS09
Jonatha Anselmi Yingdong Lu Mayank Sharma Mark S. Squillante Improved Approximations for Stochastic Loss Networks. 45-47 2009 37 SIGMETRICS Perform. Evaluation Rev. 2 https://doi.org/10.1145/1639562.1639578 db/journals/sigmetrics/sigmetrics37.html#AnselmiLSS09
Jonatha Anselmi Bruno Gaujal Performance Evaluation of Work Stealing for Streaming Applications. 18-32 2009 OPODIS https://doi.org/10.1007/978-3-642-10877-8_4 conf/opodis/2009 db/conf/opodis/opodis2009.html#AnselmiG09 Jonatha Anselmi Paolo Cremonesi Edoardo Amaldi On the Consolidation of Data-Centers with Performance Constraints. 163-176 2009 QoSA https://doi.org/10.1007/978-3-642-02351-4_11 conf/qosa/2009 db/conf/qosa/qosa2009.html#AnselmiCA09 Jonatha Anselmi Paolo Cremonesi Exact Asymptotic Analysis of Closed BCMP Networks with a Common Bottleneck. 206-220 2008 ASMTA https://doi.org/10.1007/978-3-540-68982-9_15 conf/asmta/2008 db/conf/asmta/asmta2008.html#AnselmiC08 Jonatha Anselmi Paolo Cremonesi Bounding the Performance of BCMP Networks with Load-Dependent Stations. 171-178 2008 MASCOTS conf/mascots/2008 db/conf/mascots/mascots2008.html#AnselmiC08 Jonatha Anselmi Edoardo Amaldi Paolo Cremonesi Service Consolidation with End-to-End Response Time Constraints. 345-352 2008 EUROMICRO-SEAA https://doi.org/10.1109/SEAA.2008.31 https://doi.ieeecomputersociety.org/10.1109/SEAA.2008.31 conf/seaa/2008 db/conf/seaa/seaa2008.html#AnselmiAC08 Jonatha Anselmi A new framework supporting the bottleneck analysis of multiclass queueing networks. 51 2008 VALUETOOLS https://doi.org/10.4108/ICST.VALUETOOLS2008.4383 http://dl.acm.org/citation.cfm?id=1537022 conf/valuetools/2008 db/conf/valuetools/valuetools2008.html#Anselmi08 Jonatha Anselmi Danilo Ardagna Paolo Cremonesi A QoS-based selection approach of autonomic grid services. 1-8 2007 SOCP@HPDC https://doi.org/10.1145/1272457.1272458 conf/hpdc/2007socp db/conf/hpdc/socp2007.html#AnselmiAC07 Jonatha Anselmi Giuliano Casale Paolo Cremonesi Approximate Solution of Multiclass Queuing Networks with Region Constraints. 225-230 2007 MASCOTS https://doi.org/10.1109/MASCOTS.2007.10 https://doi.ieeecomputersociety.org/10.1109/MASCOTS.2007.10 conf/mascots/2007 db/conf/mascots/mascots2007.html#AnselmiCC07 Edoardo Amaldi Danilo Ardagna Urtzi Ayesta Giuliano Casale Paolo Cremonesi Bernardo D'Auria Josu Doncel François Dufour Federica Filippini Bruno Gaujal Dann Laneuville Yingdong Lu John C. S. Lui Adrien Negre Tommaso Nesti Mauro Passacantando Tomás Prieto-Rumeau Louis-Sébastien Rebuffi Mayank Sharma Mark S. Squillante Maaike VerloopIna Maria Verloop Neil S. WaltonNeil Walton Adam Wierman Yunjian Xu Zichao Yang Huilong Zhang