izpis_h1_title_alt

Algoritmi za čiščenje pomnilnika : diplomsko delo
ID ČESEN, ANDREJ (Author), ID Dobravec, Tomaž (Mentor) More about this mentor... This link opens in a new window

.pdfPDF - Presentation file, Download (436,32 KB)
MD5: 055DFCD17ACC2AFB128DDBDCF99885FC
PID: 20.500.12556/rul/834d84a4-185b-490c-8263-a2154789de4a

Abstract
Diplomsko delo je posvečeno implementaciji avtomatskega upravljanja pomnilnika za programski jezik C. Metoda čiščenja označi-počisti se je prilagodila za nekooperativen jezik, ki ne sporoča informacij o tipih podatkov na mestih dostopnih mutatorju. Prepoznavanje kazalcev v korenih in poljih objektov je zato konzervativno, kar omogoča varno delovanje čistilca - če je vsebovana vrednost dovolj podobna kazalcu, se jo smatra kot kazalec (četudi to morda ni). Da se uporabnikove podatke zavaruje pred nenamernim pisanjem čistilca, se je označevalne bite premaknilo iz glav objektov v bitna polja, shranjena v ločenem delu pomnilnika. Na koncu sledi še vrednotenje uporabe čistilca v praksi.

Language:Slovenian
Keywords:čiščenje pomnilnika, označi-počisti, označi-strni, prepisovanje, štetje referenc, računalništvo, računalništvo in informatika, univerzitetni študij, diplomske naloge
Work type:Bachelor thesis/paper
Typology:2.11 - Undergraduate Thesis
Organization:FRI - Faculty of Computer and Information Science
Publisher:[A. Česen]
Year:2014
Number of pages:58 str.
PID:20.500.12556/RUL-29511 This link opens in a new window
COBISS.SI-ID:1536061123 This link opens in a new window
Publication date in RUL:18.09.2014
Views:963
Downloads:163
Metadata:XML DC-XML DC-RDF
:
Copy citation
Share:Bookmark and Share

Licences

License:CC BY-SA 2.5 SI, Creative Commons Attribution-ShareAlike 2.5 Slovenia
Link:https://creativecommons.org/licenses/by-sa/2.5/si/deed.en
Description:You are free to reproduce and redistribute the material in any medium or format. You are free to remix, transform, and build upon the material for any purpose, even commercially. You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use. If you remix, transform, or build upon the material, you must distribute your contributions under the same license as the original. You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.

Secondary language

Language:English
Title:Garbage collection algorithms
Abstract:
This thesis focuses on an implementation of automatic memory management in C programming language. Mark-sweep method was modified for use in uncooperative programming language, which does not share data type information of memory slots accessible by the mutator. Due to this fact, decisions on pointer identity are conservative which guarantees safe collector operation - if value looks sufficiently like a pointer, it is considered a pointer (although it might not actually be one). Mark bits were moved from object's headers to bitmaps, stored in a seperate part of memory to prevent accidental writes to user's data by the collector. Finally, the usage of garbage collector was evaluated in practice.

Keywords:garbage collection, mark-sweep, mark-compact, copying, reference counting, computer science, computer and information science, diploma

Similar documents

Similar works from RUL:
Similar works from other Slovenian collections:

Back