Segmentation Fault In Recurisve Structure With Smart Pointer

A singly linked list implemented with smart pointer, which has a reference to next, can easily cause Stack Overflow at its destruction because the destructor of the next, and the next, and the next, are called recursively. Here's the code. #in… more »
Posted under Information, Performance, Ease Of Use on 07.10.2010 • Send feedback » • PermalinkPermalink

So far, so bad.

I found a couple of things. A couple of bad things. 1. shared_ptr is not thread safe * it was stack overflow by recursive destruction Here's the code to reproduce. The reason follows. SPIntSLList.h #ifndef INT_SINGLY_LINKEDLIST #define IN… more »
Posted under Performance, Ease Of Use on 07.9.2010 • Send feedback » • PermalinkPermalink

Lock-free reference counting smart pointer

With GCC 4.4, I tested how atomic types and operations of c++0x work by implementing lock-free reference counting smart pointer. TsPersistentSmartPointer.h #ifndef PERSISTENT_SMART_POINTER #define PERSISTENT_SMART_POINTER #include <cstdato… more »
Posted under Performance, Ease Of Use on 07.8.2010 • Send feedback » • PermalinkPermalink

A Solution To Von Neumann bottleneck

Here's a question. Do you have a problem about memory performance that might have been observed as CPU or I/O bottleneck before? In other words, Where's your interests about performance bottleneck today? Memory? Even like this: Do you… more »
Posted under Performance on 05.23.2010 • Send feedback » • PermalinkPermalink

ChunkIO(Clustered Reads/Writes)

We're just having a db4o global conference in Berlin. Here's what I have suggested before and just desided to work on this year, ChunkIO(Clustered Reads/Writes). - Who is the target? device guys - What is the purpose of chunkIO? By… more »
Posted under Performance, db4o on 03.12.2008 • Send feedback » • PermalinkPermalink
Free Blog Themes and Free Blog Templates