Isi Mitrani
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Isi Mitrani has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Paul Ezhilchelvan
Newcastle University
12 shared publications - Jim Webber
Neo4j UK
4 shared publications - Michele Mazzucco
Adastral Park Newcastle University BT Group Newcastle upon Tyne UK
3 shared publications Paul McKee
Adastral Park Newcastle University BT Group Newcastle upon Tyne UK
3 shared publicationsMike Fisher
Adastral Park Newcastle University BT Group Newcastle upon Tyne UK
2 shared publications- Alexander D. Ost
University of Luxembourg, Department of Physics and Materials Science, 41 rue du Brill, L-4422, Belvaux, Luxembourg
1 shared publication
Latest Publications
- 13 February 2025
- Published by Springer Nature
- p. 1-13
Design and Analysis of Distributed Message Ordering over a Unidirectional Logical Ring
- 13 February 2025
- Published by Springer Nature
- p. 1-13
Design and Analysis of Distributed Message Ordering over a Unidirectional Logical Ring
- Open Access
- 21 May 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Performance Evaluation of Computing Systems
- Vol. 9 (3) , 1-23
Checkpointing models for tasks of different types
A server subject to random breakdowns and repairs offers services to incoming jobs whose lengths are highly variable. A checkpointing policy is in operation, aiming to protect against possibly lengthy recovery periods by backing up the current state at periodic checkpoints. The problem of how to choose a checkpointing interval to optimise performance is addressed by analysing a general queueing model which includes breakdowns, repairs, back-ups and recoveries. Exact solutions are obtained under both Markovian and non-Markovian assumptions. Numerical experiments illustrate the conditions where checkpoints are useful and where they are not, and, in the former case, quantify the achievable benefits.
- 21 May 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Modeling and Performance Evaluation of Computing Systems
- Vol. 9 (3) , 1-23
Open AccessCheckpointing models for tasks of different types
A server subject to random breakdowns and repairs offers services to incoming jobs whose lengths are highly variable. A checkpointing policy is in operation, aiming to protect against possibly lengthy recovery periods by backing up the current state at periodic checkpoints. The problem of how to choose a checkpointing interval to optimise performance is addressed by analysing a general queueing model which includes breakdowns, repairs, back-ups and recoveries. Exact solutions are obtained under both Markovian and non-Markovian assumptions. Numerical experiments illustrate the conditions where checkpoints are useful and where they are not, and, in the former case, quantify the achievable benefits.
- 7 October 2023
- Published by Springer Nature
- p. 171-185
Evaluating the Performance Impact of No-Wait Approach to Resolving Write Conflicts in Databases
- 7 October 2023
- Published by Springer Nature
- p. 171-185
Evaluating the Performance Impact of No-Wait Approach to Resolving Write Conflicts in Databases
- 15 September 2023
- Published by Springer Nature
- p. 255-269
Analysis of an Epoch Commit Protocol for Distributed Processing Systems
- 15 September 2023
- Published by Springer Nature
- p. 255-269
Analysis of an Epoch Commit Protocol for Distributed Processing Systems
- Open Access
- 27 May 2023
- Published by Elsevier in Indagationes Mathematicae
- Vol. 34 (5) , 1077-1100
A Foreground–Background queueing model with speed or capacity modulation
- 27 May 2023
- Published by Elsevier in Indagationes Mathematicae
- Vol. 34 (5) , 1077-1100
Open AccessA Foreground–Background queueing model with speed or capacity modulation
- 25 January 2023
- Published by Springer Nature
- p. 100-114
Checkpointing Models for Tasks with Widely Different Processing Times
- 25 January 2023
- Published by Springer Nature
- p. 100-114
Checkpointing Models for Tasks with Widely Different Processing Times
- 3 April 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 50-64
Design and Evaluation of an Edge Concurrency Control Protocol for Distributed Graph Databases
- 3 April 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 50-64
Design and Evaluation of an Edge Concurrency Control Protocol for Distributed Graph Databases
- Open Access
Modeling Corruption in Eventually-Consistent Graph Databases
We present a model and analysis of an eventually consistent graph database where loosely cooperating servers accept concurrent updates to a partitioned, distributed graph. The model is high-fidelity and preserves design choices from contemporary graph database management systems. To explore the problem space, we use two common graph topologies as data models for realistic experimentation. The analysis reveals, even assuming completely fault-free hardware and bug-free software, that if it is possible for updates to interfere with one-another, corruption will occur and spread significantly through the graph within the production database lifetime. Using our model, database designers and operators can compute the rate of corruption for their systems and determine whether they are sufficiently dependable for their intended use.
Open AccessModeling Corruption in Eventually-Consistent Graph Databases
We present a model and analysis of an eventually consistent graph database where loosely cooperating servers accept concurrent updates to a partitioned, distributed graph. The model is high-fidelity and preserves design choices from contemporary graph database management systems. To explore the problem space, we use two common graph topologies as data models for realistic experimentation. The analysis reveals, even assuming completely fault-free hardware and bug-free software, that if it is possible for updates to interfere with one-another, corruption will occur and spread significantly through the graph within the production database lifetime. Using our model, database designers and operators can compute the rate of corruption for their systems and determine whether they are sufficiently dependable for their intended use.
- 3 October 2018
- Published by Springer Nature
- p. 1-13
On the Degradation of Distributed Graph Databases with Eventual Consistency
- 3 October 2018
- Published by Springer Nature
- p. 1-13
On the Degradation of Distributed Graph Databases with Eventual Consistency
- 21 September 2018
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 33 (3) , 348-366
MULTI-CLASS RESOURCE SHARING WITH BATCH ARRIVALS
A cloud provider hosts virtual machines (VMs) of different types, with different resource requirements. There are bounds on the total amounts of each kind of resource that are available. Requests arrive in batches of different sizes. Under the ‘complete blocking’ policy, a request is accepted only if all the VMs in its batch can be accommodated. The ‘partial blocking’ policy would accept a request if there is room for at least one of the VMs in the batch. Blocked requests are lost, with an associated loss of revenue. The trade-offs between costs and benefits are evaluated by means of appropriate models, for which novel solutions based on fixed-point iterations are proposed. The applicability of those solutions is extended, by means of simplifications, to very large-scale systems. Numerical examples and comparisons with simulations are presented.
- 21 September 2018
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 33 (3) , 348-366
MULTI-CLASS RESOURCE SHARING WITH BATCH ARRIVALS
A cloud provider hosts virtual machines (VMs) of different types, with different resource requirements. There are bounds on the total amounts of each kind of resource that are available. Requests arrive in batches of different sizes. Under the ‘complete blocking’ policy, a request is accepted only if all the VMs in its batch can be accommodated. The ‘partial blocking’ policy would accept a request if there is room for at least one of the VMs in the batch. Blocked requests are lost, with an associated loss of revenue. The trade-offs between costs and benefits are evaluated by means of appropriate models, for which novel solutions based on fixed-point iterations are proposed. The applicability of those solutions is extended, by means of simplifications, to very large-scale systems. Numerical examples and comparisons with simulations are presented.