diff options
Diffstat (limited to 'thesis/parts/abstract.tex')
| -rw-r--r-- | thesis/parts/abstract.tex | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/thesis/parts/abstract.tex b/thesis/parts/abstract.tex index ae86901..8f13f9d 100644 --- a/thesis/parts/abstract.tex +++ b/thesis/parts/abstract.tex @@ -5,10 +5,10 @@ We present Candelabra, a system for selecting the best implementation of a conta Using the DSL proposed in \cite{qin_primrose_2023}, developers specify the way a container must behave and what operations it must be able to perform. Once they have done this, we are able to select implementations that meet those requirements, and suggest which will be the fastest based on the usage patterns of the user's program. -Our system is designed with flexibility in mind, meaning it is easy to add new container implementations, and operations. +Our system is designed with flexibility in mind, meaning it is easy to add new container implementations and operations. It is also able to scale up to larger programs, without suffering the exponential blowup in time taken that would happen with a brute-force approach. -Our approach is able to suggest the fastest implementation in most of our tests, although further testing is required on a wider range of workloads. +Our approach generates accurate estimates of each implementation's performance, and is able to find the fastest implementation in the majority of our tests. We also investigate the feasibility of adaptive containers, which switch implementation once the size reaches a certain threshold. In doing so, we identify several key concerns that future work should address. |