How to Fillet a Penguin : Runtime Data Driven Partitioning of Linux Code
- Submitting institution
-
The University of Lancaster
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 277360441
- Type
- D - Journal article
- DOI
-
10.1109/TDSC.2017.2745574
- Title of journal
- IEEE Transactions on Dependable and Secure Computing
- Article number
- -
- First page
- 945
- Volume
- 15
- Issue
- 6
- ISSN
- 1545-5971
- Open access status
- Deposit exception
- Month of publication
- August
- Year of publication
- 2017
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
I - Security
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- The paper developed an original scientific concept that the monolithic code base of an OS can be efficiently partitioned into silos as optimized for performance or for security or similar attributes of interest. The novelty of the paper lies in not only developing the partitioning concept but also that is can be conducted dynamically during OS operation. The concept was rigorously tested for correctness and efficiency across various Linux versions.
While the concept was developed primarily for the Linux code base, the proposed techniques are being explored by Microsoft and Google for their OS offerings.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
