Object swapping issues and the imagesegment implementation

Object Swapping Issues and the ImageSegment

implementation

I n g . m a r i a n o m a r t i n e z p e c km a r i a n o p e c k @ g m a i l . c o m

Saturday, November 13, 2010

The context

Problem

Use more memory than needed.

Make OOP languages unsuitable for memory limited devices.

Existence of unused but referenced objects.

The contextIn OOP primary memory is represented by an object graph

D E F G H

Garbage CollectorOnly collects objects that nobody else points to.

D E F G H

But...what happens with referenced yet unused objects?

D E F G H

Swap out (not remove) unused objects to disk.

Automatically load them back when needed.

There are related works...but no one solves all the problems

Main challenges

Not to use more memory than the one released by swapping.

Low overhead penalty.

Group objects in an smart way.

Key aspects

Mark and trace unused/used objects at runtime.

The usage of proxies.

Group unused objects (subgraphs).

Why we need to group objects?

Because if we replace each object by a proxy, we release little memory.

We want to replace a whole group by one or a few proxies.

Why subgraphs?

Group of objects that are used (or not used) together.

We need few proxies (for the roots) for several objects.

Experiments done

Modify Smalltalk VM to mark and trace objects usage.

Visualize objects and memory usage.

Take statistics from different scenarios.

deployed web application example

Amount of objects

Used Unused

Amount of objects

Used Unused

Amount of memory

Used Unused

Swapping steps and challenges

1.Identify sets of objects and serialize them. Problems: cycles, speed, etc.

2.Write the serialized objects into a file. Problems: file format, encoding, speed, etc.

3. Load the objects from a file. Problems: class reshape, avoid duplicates, speed, etc.

Subgraphs

A (Root)

B (Root)

C (Root)

D E F G H

Subgraph to process

Roots Inner Shared External

More problems

Should shared objects be included or not?

GC moves objects.

Pointers update.

Class changes.

Recreate and reinitialize objects.

Code executed after loading.

Special objects.17

A (Root)

B (Root)

C (Root)

D E F G H

Subgraph to process

Roots Inner Shared External

ImageSegment

ImageSegment basis Only write/swap roots and inner objects.

Shared objects are NOT swapped.

Keep an array in memory for the shared objects.

Update object pointers to point to a relative address inside the arrays (offset).

Roots are replaced by proxies.

Uses GC facilities to detect shared objects.

The goal

Input -- Output

D E F G H

I J K L

The goal

Input -- OutputD F G

P1 P3P2

The goal

Input -- OutputD F G

P1 P3P2

aMessage

The goal

Input -- Output

D E F G H

I J K L

Simple example

Subgraph traverse

D E F G H

I J K L

Serialized objects WordArrayShared objects Array

anImageSegment

Subgraph traverse

D E F G H

I J K L

A’ B’ C’

anImageSegment

Subgraph traverse

D E F G H

I J K L

A’ B’ C’

anImageSegment

Subgraph traverse

D E F G H

I J K L

A’ B’ C’

anImageSegment

Subgraph traverse

D E F G H

I J K L

A’ B’ C’

anImageSegment

Subgraph traverse

D E F G H

I J K L

A’ B’ C’D

anImageSegment

Subgraph traverse

D E F G H

I J K L

A’ B’ C’D

anImageSegment

Subgraph traverse

D E F G H

I J K L

A’ B’ C’D

offsetSerialized objects WordArray

Shared objects Array

anImageSegment

Subgraph traverse

D E F G H

I J K L

A’ B’ C’ E’D

offsetSerialized objects WordArray

anImageSegment

Subgraph traverse

D E F G H

I J K L

offset

anImageSegment

Subgraph traverse

D E F G H

I J K L

anImageSegment

Subgraph traverse

D E F G H

I J K L

anImageSegment

Subgraph traverse

D E F G H

I J K L

A’ B’ C’ E’F GD J

I’ H’ L’

anImageSegment

D E F G H

I J K L

A’ B’ C’ E’F GD J

I’ H’ L’

Offset Memory address

Roots replace

D E F G H

I J K L

A’ B’ C’ E’ F GD JI’ H’ L’

Serialized objects WordArray Shared objects Array

anImageSegment

D E F G H

I J K L

anImageSegment

P1 P3P2

anImageSegment

P1 P3P2

Write to file

A’ B’ C’ E’ I’ H’ L’

Serialized objects WordArray

F GD J

anImageSegment

P1 P3P2Binary file

F GD J

anImageSegment

P1 P3P2Binary file

A’ B’ C’ E’ I’ H’ L’

ImageSegment conclusions

Good speed.

Graph traverse is done in VM side.

Good use of GC facilities.

You have to be aware of shared objects.

Bad granularity level.

Implicit needed information in object graphs.

Thanks!

Mariano Martinez Peckmarianopeck@gmail.com

Object swapping issues and the imagesegment implementation

Technology

Transcript of Object swapping issues and the imagesegment implementation

Body Swapping

Fair deal swapping

Swapping - csl.skku.edu

Fpga Implementation of Moving Object

Design and Implementation of a Multi-stage, Object ...eprints.qut.edu.au/16559/1/Gregory_Michael_Neverov_Thesis.pdf · Design and Implementation of a Multi-stage, Object-oriented

Operating Systems. Memory Managementso-grado/2020-21/Temas/SO...Operating Systems. Memory Management 28 / 91 Swapping Swapping Swapping of whole processes in old systems to increase

Chapter 6 Sorting. Agenda Swapping two values in array of int Bubble sort O(n 2 ) Swapping/sorting an array of Object Swapping/sorting a Vector of Object.

Design & Implementation of Process Object Types … & Implementation of Process Object Types using SAP Process Object ... SAP BPM Highly recommended ... Design & Implementation of

Implementation of Object Oriented Programming in …Limitations of Current Implementation of Object Oriented Programming in LabVIEW 8.20 and a Proposal for an Alternative Implementation

Berth swapping

Object Swapping Challenges: an Evaluation of ImageSegment

Object Graph Swapping

Swapping Card

CSE311 – Object Oriented Design and Implementation

OBJECT-ORIENTED IMPLEMENTATION OF OPTION ...etd.lib.metu.edu.tr/upload/12618949/index.pdfABSTRACT OBJECT-ORIENTED IMPLEMENTATION OF OPTION PRICING VIA MATLAB: MONTE CARLO APPROACH

Mixin Layers: An Object-Oriented Implementation Technique ... · Mixin Layers: An Object-Oriented Implementation Technique for Reﬁnements and Collaboration-Based Designs Abstract

Object-Oriented Implementation of LTE Turbo Codes - …wvuscholar.wvu.edu/reports/Gangadi_Anusha.pdf · Abstract Object-Oriented Implementation of LTE Turbo Codes by Anusha Gangadi

1999 1 Memory Management Background Logical versus Physical Address Space Swapping Contiguous Allocation Virtual memory Management Paging –Background –Implementation.

implementation of fpga-based object tracking algorithm

Data Coarsening and Data Swapping Algorithmssupport.sas.com/resources/papers/proceedings14/1603-2014.pdf · swapping, finding swapping partners, and swapping data values for the target