Browse wiki

From IOI Wiki
Jump to: navigation, search
Performance analysis of sandboxes for reactive tasks
Abstract Security mechanisms for programming contes
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.
iable results unless CPU affinity is used.  +
Free 1 +
Has author Bruce Merry +
Journal Olympiads in Informatics +
Pages 87-94 +
Title Performance analysis of sandboxes for reactive tasks +
Type Article +
Volume 4 +
Year 2010 +
Categories Publications about grading systems
Modification date
This property is a special property in this wiki.
27 July 2010 19:46:35  +
URL
This property is a special property in this wiki.
http://www.mii.lt/olympiads_in_informatics/htm/INFOL052.htm  +
hide properties that link here 
Performance analysis of sandboxes for reactive tasks + Title
 

 

Enter the name of the page to start browsing from.