default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiletta Olliaro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j13]Zhongrui Chen
, Adityo Anggraito, Diletta Olliaro, Andrea Marin, Marco Ajmone Marsan, Benjamin Berg, Isaac Grosof:
Improving nonpreemptive multiserver job scheduling with quickswap. Perform. Evaluation 171: 102525 (2026)- [j12]François Baccelli, Diletta Olliaro, Marco Ajmone Marsan, Andrea Marin:
The Multiserver-Job Stochastic Recurrence Equation for Cloud Computing Performance Evaluation. Proc. ACM Meas. Anal. Comput. Syst. 10(1): 23:1-23:25 (2026) - [j11]Diletta Olliaro, Sabina Rossi, Adityo Anggraito, Andrea Marin, Marco Ajmone Marsan:
On the Performance of SMASH: A Non-Preemptive Window-Based Scheduler for Multiserver Jobs. IEEE Trans. Parallel Distributed Syst. 37(4): 966-981 (2026) - [c7]François Baccelli, Diletta Olliaro, Marco Ajmone Marsan, Andrea Marin:
The Multiserver-Job Stochastic Recurrence Equation for Cloud Computing Performance Evaluation. SIGMETRICS (Abstracts) 2026: 150-152 - [i3]François Baccelli, Diletta Olliaro, Marco Ajmone Marsan, Andrea Marin:
The Multiserver-Job Stochastic Recurrence Equation for Cloud Computing Performance Evaluation. CoRR abs/2601.20653 (2026) - 2025
- [j10]Diletta Olliaro, Gianfranco Balbo, Andrea Marin, Matteo Sereno:
Computational algorithms and arrival theorem for non-conventional product-form solutions. Perform. Evaluation 168: 102469 (2025) - [j9]Adityo Anggraito, Diletta Olliaro, Marco Ajmone Marsan, Andrea Marin:
The Multiserver Job Queuing Model with big and small jobs: Stability in the case of infinite servers. Perform. Evaluation 168: 102477 (2025) - [j8]Adityo Anggraito, Diletta Olliaro, Andrea Marin, Marco Ajmone Marsan:
The Multiserver Job Queuing Model with two job classes and Cox-2 service times. Perform. Evaluation 169: 102486 (2025) - [j7]Simone Bozzolan, Diletta Olliaro, Stefano Calzavara, Andrea Marin, Gianfranco Balbo, Matteo Sereno:
Stochastic Models for Remote Timing Attacks. Proc. Priv. Enhancing Technol. 2025(3): 545-559 (2025) - [j6]Diletta Olliaro:
Models for Throughput Maximisation in Distributed Systems. SIGMETRICS Perform. Evaluation Rev. 52(3): 19-22 (2025) - [j5]Diletta Olliaro, Adityo Anggraito, Marco Ajmone Marsan, Simonetta Balsamo, Andrea Marin:
The Impact of Service Demand Variability on Data Center Performance. IEEE Trans. Parallel Distributed Syst. 36(2): 120-132 (2025) - [c6]Andrea Marin, Diletta Olliaro, Sabina Rossi, Daniel Sadoc Menasché:
A Product-Form Model for Systems with Aging Objects and Similarities. QEST+FORMATS 2025: 219-236 - [c5]Diletta Olliaro, Michela Meo, Matteo Sereno, Andrea Marin, Marco Ajmone Marsan:
Energy/Performance Trade-Off in RANs with Dynamic Management of Frequency Bands. ITC-36 2025: 1-9 - [i2]Zhongrui Chen, Adityo Anggraito, Diletta Olliaro, Andrea Marin, Marco Ajmone Marsan, Benjamin Berg, Isaac Grosof:
Improving Nonpreemptive Multiserver Job Scheduling with Quickswap. CoRR abs/2509.01893 (2025) - 2024
- [j4]Diletta Olliaro, Marco Ajmone Marsan, Simonetta Balsamo, Andrea Marin:
The Saturated Multiserver Job Queuing Model with Two Classes of Jobs: Exact and Approximate Results. SIGMETRICS Perform. Evaluation Rev. 51(4): 28-29 (2024) - [j3]Diletta Olliaro, Giuliano Casale, Andrea Marin, Sabina Rossi:
A Product-form Network for Systems with Job Stealing Policies. ACM Trans. Model. Perform. Evaluation Comput. Syst. 9(2): 6:1-6:26 (2024) - [c4]Adityo Anggraito, Diletta Olliaro, Marco Ajmone Marsan, Andrea Marin:
Stability Condition for the Multi-server Job Queuing Model: Sensitivity Analysis. ASMTA 2024: 148-163 - [c3]Adityo Anggraito, Diletta Olliaro, Andrea Marin, Marco Ajmone Marsan:
The Non-Saturated Multiserver Job Queuing Model with Two Job Classes: a Matrix Geometric Analysis. MASCOTS 2024: 1-8 - [c2]Diletta Olliaro, Vincenzo Mancuso, Paolo Castagno, Matteo Sereno, Marco Ajmone Marsan:
Gaming on the Edge: Performance Issues of Distributed Online Gaming. IFIP Networking 2024: 259-267 - [i1]Gianfranco Balbo, Andrea Marin, Diletta Olliaro, Matteo Sereno:
Computational Algorithms for the Product Form Solution of Closed Queuing Networks with Finite Buffers and Skip-Over Policy. CoRR abs/2409.08075 (2024) - 2023
- [j2]Diletta Olliaro, Marco Ajmone Marsan, Simonetta Balsamo, Andrea Marin:
The saturated Multiserver Job Queuing Model with two classes of jobs: Exact and approximate results. Perform. Evaluation 162: 102370 (2023) - [j1]Andrea Marin, Sabina Rossi, Diletta Olliaro:
A product-form network for systems with job stealing policies. SIGMETRICS Perform. Evaluation Rev. 50(4): 2-4 (2023) - [c1]Diletta Olliaro, Gianfranco Balbo, Andrea Marin, Matteo Sereno:
Skipping and Fetching: Insights on Non-conventional Product-Form Solutions. QEST 2023: 110-126
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2026-06-27 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
