Skip to content
Snippets Groups Projects
Commit 4c2a162c authored by Maxime MORGE's avatar Maxime MORGE :construction_worker:
Browse files

PSSI: README.md of XP

parent a62c22f8
No related branches found
No related tags found
No related merge requests found
......@@ -17,19 +17,19 @@ The following features are evaluated:
- [Comparison with Distributed Constraint Optimization Problem (DCOP) solver](#comparison-with-distributed-constraint-optimization-problem-dcop-solver)
- [Swap](#swap)
We consider the simulated cost c^S(t,n) as the effective cost of performing the task t
We consider the simulated cost $c^S(t,n)$ as the effective cost of performing the task t
by the node n. :
- with a perfect knowledge of the computing environment, c^S(t,n) = c(t,n);
- with half of the nodes slowing down, c^S(t,n) = 2 * c(t,n) if n mod 2=1 and c^S(t,n) = c(t,n) otherwise.
- with a perfect knowledge of the computing environment, $c^S(t,n) = cost(t,n)$;
- with half of the nodes slowing down, $c^S(t,n) = 2 * c(t,n)$ if $n mod 2=1$ and $c^S(t,n) = cost(t,n)$ otherwise.
This is the reason why e distinguish the two following metrics:
- the simulated flowtime C^S(A) for an allocation A according to the simulated costs;
- the real flowtime C^(At) for an allocation A according to the task completion times which are measured.
- the simulated flowtime $C^S(A)$ for an allocation A according to the simulated costs;
- the real flowtime $C^(At)$ for an allocation A according to the task completion times which are measured.
The performance improvement rate is defined:
γ = (C^R(AO) - C^R(Ae))/C^R(A0)
$γ = (C^R(A0) - C^R(Ae))/C^R(A0)$
where Ae is the allocation where tasks are executed and A0 is the initial allocation.
where $A_e$ is the allocation where tasks are executed and $A_0$ is the initial allocation.
During the consumption of the initial allocation, we consider the following metrics :
- the flowtime of the current allocation according to the completion times of tasks
......@@ -108,7 +108,7 @@ time scale) of 128 tasks. It confirms that the best flowtime
achieved is that obtained by our strategy when it is run concurrently with the
executed concurrently with the consumption process. The responsiveness of our strategy is explained by
the reallocation of tasks bundles that represent almost half of them thanks to multiple
concurrent bilateral negotiations that begin even before the consumption process (after $0.1$ second).
concurrent bilateral negotiations that begin even before the consumption process (after 0.1 second).
![](../../experiments/runningAuction/figures/monitor.svg)
......@@ -144,11 +144,10 @@ flowtime of the initial random allocation. Even if the simulated flowtime of
the SSI-based allocation is very good, this method
method delays the consumption process in order to first obtain a balanced
allocation and therefore penalises the achieved flowtime. Conversely, the flowtime achieved
by the reallocation methods reallocation methods applied during the consumption process,
by the reallocation methods applied during the consumption process,
whether this is our strategy or whether it is based on PSI auctions, is better than the achieved
flowtime realised from random initial allocation. Furthermore, the
flowtime of the reallocation methods is bounded by the
the simulated flowtime of the reallocation (if an oracle calculates the
flowtime of the reallocation methods is bounded by the simulated flowtime of the reallocation (if an oracle calculates the
reallocation in constant time). These methods improve the flowtime
by reallocating, during the consumption process, non-local tasks whose delegation reduces the cost.
As the number of delegations in strategy is greater than the number of delegations in the PSI-based
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment