OLYMPIADS IN INFORMATICS, 2010, Vol. 4, 87-94
© Institute of Mathematics and Informatics,
ISSN 1822-7732
Performance Analysis of Sandboxes for Reactive Tasks
Bruce MERRY
ARM Ltd 110 Fulbourn Road, Cambridge, CB1 9NJ, United Kingdom E-mail: bmerry@gmail.com
Abstract
Security mechanisms for programming contests introduce some overhead into time measurements. When large numbers of system calls are made, as is common in reactive tasks with processes communicating over pipes, this may significantly distort timing results. We compared the performance and consistency of two sandboxes based on different security mechanisms. We found that in-kernel security has negligible effect on measured run-times, while ptrace-based security can add overhead of around 75%. We also found that ptrace-based security on a dual-core CPU adds far greater overhead as well as producing highly variable results unless CPU affinity is used.
Keywords:
sandbox, security, timing
To preview full article text in PDF format click here
You could obtain free Acrobat Reader from Adobe
Copyright © Olympiads in Informatics, Vilnius University Institute of Mathematics and Informatics, 2010