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.rss
dblp: Jonatha Anselmi https://dblp.org/pid/98/6095.html dblp person page RSS feed Fri, 18 Oct 2024 20:32:13 +0200 en-US daily 1 released under the CC0 1.0 license dblp@dagstuhl.de (dblp team) dblp@dagstuhl.de (dblp team) Computers/Computer_Science/Publications/Bibliographies http://www.rssboard.org/rss-specification https://dblp.org/img/logo.144x51.pngdblp: Jonatha Anselmihttps://dblp.org/pid/98/6095.html14451 Learning optimal admission control in partially observable queueing networks.https://doi.org/10.1007/s11134-024-09917-y, , :
Learning optimal admission control in partially observable queueing networks. Queueing Syst. Theory Appl. 108(1): 31-79 ()]]>https://dblp.org/rec/journals/questa/AnselmiGR24Tue, 01 Oct 2024 01:00:00 +0200 A Stochastic Approach for Scheduling AI Training Jobs in GPU-Based Systems.https://doi.org/10.1109/TCC.2023.3336540, , , :
A Stochastic Approach for Scheduling AI Training Jobs in GPU-Based Systems. IEEE Trans. Cloud Comput. 12(1): 53-69 ()]]>https://dblp.org/rec/journals/tcc/FilippiniAAG24Mon, 01 Jan 2024 00:00:00 +0100 Load Balancing with Job-Size Testing: Performance Improvement or Degradation?https://doi.org/10.1145/3651154, :
Load Balancing with Job-Size Testing: Performance Improvement or Degradation? ACM Trans. Model. Perform. Evaluation Comput. Syst. 9(2): 8:1-8:27 ()]]>https://dblp.org/rec/journals/tompecs/AnselmiD24Sat, 01 Jun 2024 01:00:00 +0200 Asynchronous Load Balancing and Auto-Scaling: Mean-Field Limit and Optimal Design.https://doi.org/10.1109/TNET.2024.3368130:
Asynchronous Load Balancing and Auto-Scaling: Mean-Field Limit and Optimal Design. IEEE/ACM Trans. Netw. 32(4): 2960-2971 ()]]>https://dblp.org/rec/journals/ton/Anselmi24Thu, 01 Aug 2024 01:00:00 +0200 Balanced Splitting: A Framework for Achieving Zero-wait in the Multiserver-job Model.https://doi.org/10.48550/arXiv.2409.18557, :
Balanced Splitting: A Framework for Achieving Zero-wait in the Multiserver-job Model. CoRR abs/2409.18557 ()]]>https://dblp.org/rec/journals/corr/abs-2409-18557Mon, 01 Jan 2024 00:00:00 +0100 Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space.https://doi.org/10.48550/arXiv.2302.10667, , :
Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space. CoRR abs/2302.10667 ()]]>https://dblp.org/rec/journals/corr/abs-2302-10667Sun, 01 Jan 2023 00:00:00 +0100 Load Balancing with Job-Size Testing: Performance Improvement or Degradation?https://doi.org/10.48550/arXiv.2304.00899, :
Load Balancing with Job-Size Testing: Performance Improvement or Degradation? CoRR abs/2304.00899 ()]]>https://dblp.org/rec/journals/corr/abs-2304-00899Sun, 01 Jan 2023 00:00:00 +0100 Learning Optimal Admission Control in Partially Observable Queueing Networks.https://doi.org/10.48550/arXiv.2308.02391, , :
Learning Optimal Admission Control in Partially Observable Queueing Networks. CoRR abs/2308.02391 ()]]>https://dblp.org/rec/journals/corr/abs-2308-02391Sun, 01 Jan 2023 00:00:00 +0100 Replication vs speculation for load balancing.https://doi.org/10.1007/s11134-022-09809-z:
Replication vs speculation for load balancing. Queueing Syst. Theory Appl. 100(3-4): 389-391 ()]]>https://dblp.org/rec/journals/questa/Anselmi22Sat, 01 Jan 2022 00:00:00 +0100 Optimal Speed Profile of a DVFS Processor under Soft Deadlines.https://doi.org/10.1145/3529113.3529139, , :
Optimal Speed Profile of a DVFS Processor under Soft Deadlines. SIGMETRICS Perform. Evaluation Rev. 49(3): 71-72 ()]]>https://dblp.org/rec/journals/sigmetrics/AnselmiGR22Sat, 01 Jan 2022 00:00:00 +0100 Stability and Optimization of Speculative Queueing Networks.https://doi.org/10.1109/TNET.2021.3128778, :
Stability and Optimization of Speculative Queueing Networks. IEEE/ACM Trans. Netw. 30(2): 911-922 ()]]>https://dblp.org/rec/journals/ton/AnselmiW22Sat, 01 Jan 2022 00:00:00 +0100 Energy Optimal Activation of Processors for the Execution of a Single Task with Unknown Size.https://doi.org/10.1109/MASCOTS56607.2022.00017, :
Energy Optimal Activation of Processors for the Execution of a Single Task with Unknown Size. MASCOTS : 65-72]]>https://dblp.org/rec/conf/mascots/AnselmiG22Sat, 01 Jan 2022 00:00:00 +0100 Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space.http://papers.nips.cc/paper_files/paper/2022/hash/5d2781cc34f459618a9a504761043055-Abstract-Conference.html, , :
Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space. NeurIPS ]]>https://dblp.org/rec/conf/nips/AnselmiGR22Sat, 01 Jan 2022 00:00:00 +0100 Asynchronous Load Balancing and Auto-scaling: Mean-Field Limit and Optimal Design.https://doi.org/10.48550/arXiv.2204.02352:
Asynchronous Load Balancing and Auto-scaling: Mean-Field Limit and Optimal Design. CoRR abs/2204.02352 ()]]>https://dblp.org/rec/journals/corr/abs-2204-02352Sat, 01 Jan 2022 00:00:00 +0100 Optimal speed profile of a DVFS processor under soft deadlines.https://doi.org/10.1016/j.peva.2021.102245, , :
Optimal speed profile of a DVFS processor under soft deadlines. Perform. Evaluation 152: 102245 ()]]>https://dblp.org/rec/journals/pe/AnselmiGR21Fri, 01 Jan 2021 00:00:00 +0100 Stability and Optimization of Speculative Queueing Networks.https://arxiv.org/abs/2104.10426, :
Stability and Optimization of Speculative Queueing Networks. CoRR abs/2104.10426 ()]]>https://dblp.org/rec/journals/corr/abs-2104-10426Fri, 01 Jan 2021 00:00:00 +0100 Power-of-d-Choices with Memory: Fluid Limit and Optimality.https://doi.org/10.1287/moor.2019.1014, :
Power-of-d-Choices with Memory: Fluid Limit and Optimality. Math. Oper. Res. 45(3): 862-888 ()]]>https://dblp.org/rec/journals/mor/AnselmiD20Wed, 01 Jan 2020 00:00:00 +0100 Combining Size-Based Load Balancing with Round-Robin for Scalable Low Latency.https://doi.org/10.1109/TPDS.2019.2950621:
Combining Size-Based Load Balancing with Round-Robin for Scalable Low Latency. IEEE Trans. Parallel Distributed Syst. 31(4): 886-896 ()]]>https://dblp.org/rec/journals/tpds/Anselmi20Wed, 01 Jan 2020 00:00:00 +0100 Asymptotically Optimal Size-Interval Task Assignments.https://doi.org/10.1109/TPDS.2019.2920121, :
Asymptotically Optimal Size-Interval Task Assignments. IEEE Trans. Parallel Distributed Syst. 30(11): 2422-2433 ()]]>https://dblp.org/rec/journals/tpds/AnselmiD19Tue, 01 Jan 2019 00:00:00 +0100 Computable approximations for average Markov decision processes in continuous time.https://doi.org/10.1017/jpr.2018.36, , :
Computable approximations for average Markov decision processes in continuous time. J. Appl. Probab. 55(2): 571-592 ()]]>https://dblp.org/rec/journals/jap/AnselmiDP18Mon, 01 Jan 2018 00:00:00 +0100 Power-of-d-Choices with Memory: Fluid Limit and Optimality.http://arxiv.org/abs/1802.06566, :
Power-of-d-Choices with Memory: Fluid Limit and Optimality. CoRR abs/1802.06566 ()]]>https://dblp.org/rec/journals/corr/abs-1802-06566Mon, 01 Jan 2018 00:00:00 +0100 Asymptotically optimal open-loop load balancing.https://doi.org/10.1007/s11134-017-9547-9:
Asymptotically optimal open-loop load balancing. Queueing Syst. Theory Appl. 87(3-4): 245-267 ()]]>https://dblp.org/rec/journals/questa/Anselmi17Sun, 01 Jan 2017 00:00:00 +0100 The Economics of the Cloud.https://doi.org/10.1145/3086574, , , , , :
The Economics of the Cloud. ACM Trans. Model. Perform. Evaluation Comput. Syst. 2(4): 18:1-18:23 ()]]>https://dblp.org/rec/journals/tompecs/AnselmiALWXY17Sun, 01 Jan 2017 00:00:00 +0100 Piecewise optimal trajectories of observer for bearings-only tracking by quantization.https://doi.org/10.23919/ICIF.2017.8009824, , , , :
Piecewise optimal trajectories of observer for bearings-only tracking by quantization. FUSION : 1-7]]>https://dblp.org/rec/conf/fusion/ZhangDALN17Sun, 01 Jan 2017 00:00:00 +0100 Decentralized Proportional Load Balancing.https://doi.org/10.1137/140969361, :
Decentralized Proportional Load Balancing. SIAM J. Appl. Math. 76(1): 391-410 ()]]>https://dblp.org/rec/journals/siamam/AnselmiW16Fri, 01 Jan 2016 00:00:00 +0100 Generalized Nash equilibria for SaaS/PaaS Clouds.https://doi.org/10.1016/j.ejor.2013.12.007, , :
Generalized Nash equilibria for SaaS/PaaS Clouds. Eur. J. Oper. Res. 236(1): 326-339 ()]]>https://dblp.org/rec/journals/eor/AnselmiAP14Wed, 01 Jan 2014 00:00:00 +0100 Efficiency of simulation in monotone hyper-stable queueing networks.https://doi.org/10.1007/s11134-013-9357-7, :
Efficiency of simulation in monotone hyper-stable queueing networks. Queueing Syst. Theory Appl. 76(1): 51-72 ()]]>https://dblp.org/rec/journals/questa/AnselmiG14Wed, 01 Jan 2014 00:00:00 +0100 The economics of the cloud: price competition and congestion.https://doi.org/10.1145/2692375.2692380, , , , , :
The economics of the cloud: price competition and congestion. SIGecom Exch. 13(1): 58-63 ()]]>https://dblp.org/rec/journals/sigecom/AnselmiALWXY14Wed, 01 Jan 2014 00:00:00 +0100 The economics of the cloud: price competition and congestion.https://doi.org/10.1145/2627534.2627549, , , , , :
The economics of the cloud: price competition and congestion. SIGMETRICS Perform. Evaluation Rev. 41(4): 47-49 ()]]>https://dblp.org/rec/journals/sigmetrics/AnselmiALWXY14Wed, 01 Jan 2014 00:00:00 +0100 Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies.http://arxiv.org/abs/1404.4547, , :
Control of parallel non-observable queues: asymptotic equivalence and optimality of periodic policies. CoRR abs/1404.4547 ()]]>https://dblp.org/rec/journals/corr/AnselmiGN14Wed, 01 Jan 2014 00:00:00 +0100 Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence.https://doi.org/10.1287/moor.1120.0583, , :
Closed Queueing Networks Under Congestion: Nonbottleneck Independence and Bottleneck Convergence. Math. Oper. Res. 38(3): 469-491 ()]]>https://dblp.org/rec/journals/mor/AnselmiDW13Tue, 01 Jan 2013 00:00:00 +0100 Heavy-traffic revenue maximization in parallel multiclass queues.https://doi.org/10.1016/j.peva.2013.08.008, :
Heavy-traffic revenue maximization in parallel multiclass queues. Perform. Evaluation 70(10): 806-821 ()]]>https://dblp.org/rec/journals/pe/AnselmiC13Tue, 01 Jan 2013 00:00:00 +0100 Competition yields efficiency in load balancing games.https://doi.org/10.1016/j.peva.2011.07.005, , :
Competition yields efficiency in load balancing games. Perform. Evaluation 68(11): 986-1001 ()]]>https://dblp.org/rec/journals/pe/AnselmiAW11Sat, 01 Jan 2011 00:00:00 +0100 Energy-aware capacity scaling in virtualized environments with performance guarantees.https://doi.org/10.1016/j.peva.2011.07.004, :
Energy-aware capacity scaling in virtualized environments with performance guarantees. Perform. Evaluation 68(11): 1207-1221 ()]]>https://dblp.org/rec/journals/pe/AnselmiV11Sat, 01 Jan 2011 00:00:00 +0100 The price of forgetting in parallel and non-observable queues.https://doi.org/10.1016/j.peva.2011.07.023, :
The price of forgetting in parallel and non-observable queues. Perform. Evaluation 68(12): 1291-1311 ()]]>https://dblp.org/rec/journals/pe/AnselmiG11Sat, 01 Jan 2011 00:00:00 +0100 On the efficiency of perfect simulation in monotone queueing networks.https://doi.org/10.1145/2034832.2034847, :
On the efficiency of perfect simulation in monotone queueing networks. SIGMETRICS Perform. Evaluation Rev. 39(2): 56-58 ()]]>https://dblp.org/rec/journals/sigmetrics/AnselmiG11Sat, 01 Jan 2011 00:00:00 +0100 A unified framework for the bottleneck analysis of multiclass queueing networks.https://doi.org/10.1016/j.peva.2009.09.002, :
A unified framework for the bottleneck analysis of multiclass queueing networks. Perform. Evaluation 67(4): 218-234 ()]]>https://dblp.org/rec/journals/pe/AnselmiC10Fri, 01 Jan 2010 00:00:00 +0100 The price of anarchy in parallel queues revisited.https://doi.org/10.1145/1811039.1811083, :
The price of anarchy in parallel queues revisited. SIGMETRICS : 353-354]]>https://dblp.org/rec/conf/sigmetrics/AnselmiG10Fri, 01 Jan 2010 00:00:00 +0100 Optimal routing in parallel, non-observable queues and the price of anarchy revisited.https://doi.org/10.1109/ITC.2010.5608745, :
Optimal routing in parallel, non-observable queues and the price of anarchy revisited. ITC : 1-8]]>https://dblp.org/rec/conf/teletraffic/AnselmiG10Fri, 01 Jan 2010 00:00:00 +0100 Improved approximations for the Erlang loss model.https://doi.org/10.1007/s11134-009-9117-x, , , :
Improved approximations for the Erlang loss model. Queueing Syst. Theory Appl. 63(1-4): 217-239 ()]]>https://dblp.org/rec/journals/questa/AnselmiLSS09Thu, 01 Jan 2009 00:00:00 +0100 Improved Approximations for Stochastic Loss Networks.https://doi.org/10.1145/1639562.1639578, , , :
Improved Approximations for Stochastic Loss Networks. SIGMETRICS Perform. Evaluation Rev. 37(2): 45-47 ()]]>https://dblp.org/rec/journals/sigmetrics/AnselmiLSS09Thu, 01 Jan 2009 00:00:00 +0100 Performance Evaluation of Work Stealing for Streaming Applications.https://doi.org/10.1007/978-3-642-10877-8_4, :
Performance Evaluation of Work Stealing for Streaming Applications. OPODIS : 18-32]]>https://dblp.org/rec/conf/opodis/AnselmiG09Thu, 01 Jan 2009 00:00:00 +0100 On the Consolidation of Data-Centers with Performance Constraints.https://doi.org/10.1007/978-3-642-02351-4_11, , :
On the Consolidation of Data-Centers with Performance Constraints. QoSA : 163-176]]>https://dblp.org/rec/conf/qosa/AnselmiCA09Thu, 01 Jan 2009 00:00:00 +0100 Exact Asymptotic Analysis of Closed BCMP Networks with a Common Bottleneck.https://doi.org/10.1007/978-3-540-68982-9_15, :
Exact Asymptotic Analysis of Closed BCMP Networks with a Common Bottleneck. ASMTA : 206-220]]>https://dblp.org/rec/conf/asmta/AnselmiC08Tue, 01 Jan 2008 00:00:00 +0100 Bounding the Performance of BCMP Networks with Load-Dependent Stations.https://dblp.org/pid/98/6095.html, :
Bounding the Performance of BCMP Networks with Load-Dependent Stations. MASCOTS : 171-178]]>https://dblp.org/rec/conf/mascots/AnselmiC08Tue, 01 Jan 2008 00:00:00 +0100 Service Consolidation with End-to-End Response Time Constraints.https://doi.org/10.1109/SEAA.2008.31, , :
Service Consolidation with End-to-End Response Time Constraints. EUROMICRO-SEAA : 345-352]]>https://dblp.org/rec/conf/seaa/AnselmiAC08Tue, 01 Jan 2008 00:00:00 +0100 A new framework supporting the bottleneck analysis of multiclass queueing networks.https://doi.org/10.4108/ICST.VALUETOOLS2008.4383:
A new framework supporting the bottleneck analysis of multiclass queueing networks. VALUETOOLS : 51]]>https://dblp.org/rec/conf/valuetools/Anselmi08Tue, 01 Jan 2008 00:00:00 +0100 A QoS-based selection approach of autonomic grid services.https://doi.org/10.1145/1272457.1272458, , :
A QoS-based selection approach of autonomic grid services. SOCP@HPDC : 1-8]]>https://dblp.org/rec/conf/hpdc/AnselmiAC07Mon, 01 Jan 2007 00:00:00 +0100 Approximate Solution of Multiclass Queuing Networks with Region Constraints.https://doi.org/10.1109/MASCOTS.2007.10, , :
Approximate Solution of Multiclass Queuing Networks with Region Constraints. MASCOTS : 225-230]]>https://dblp.org/rec/conf/mascots/AnselmiCC07Mon, 01 Jan 2007 00:00:00 +0100