<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Persistent notes &#187; big</title>
	<atom:link href="http://alexkr.com/notes/memos/feed/" rel="self" type="application/rss+xml" />
	<link>http://alexkr.com</link>
	<description>Alexander Krivutsenko&#039;s online journal</description>
	<lastBuildDate>Sat, 07 Apr 2012 20:46:40 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>How to print a call stack</title>
		<link>http://alexkr.com/memos/370/printing-backtrace/</link>
		<comments>http://alexkr.com/memos/370/printing-backtrace/#comments</comments>
		<pubDate>Tue, 14 Sep 2010 21:47:42 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[c]]></category>
		<category><![CDATA[gdb]]></category>

		<guid isPermaLink="false">http://alexkr.com/?p=370</guid>
		<description><![CDATA[While debugging a complex project have you ever experienced such a situation when the function is being called twice although it is only capable for getting called once by design?

For example, releasing some system resources, or smart pointer destruction.

In such cases it is easier to understand the problem when we can trace
the call stack of [...]]]></description>
		<wfw:commentRss>http://alexkr.com/memos/370/printing-backtrace/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Portable 64 bit integer type</title>
		<link>http://alexkr.com/memos/358/portable-64-bit-integer-type/</link>
		<comments>http://alexkr.com/memos/358/portable-64-bit-integer-type/#comments</comments>
		<pubDate>Wed, 31 Mar 2010 21:43:38 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[c]]></category>
		<category><![CDATA[portability]]></category>

		<guid isPermaLink="false">http://alexkr.com/?p=358</guid>
		<description><![CDATA[Here I would like to write about coding a &#8220;portable&#8221; C programs in a sense that they produce same results when compiled and executed on 32 and 64 bits architectures.

The problem I faced with DES is that I need to make sure that my integers are exactly 32 bits on all platforms where I compile [...]]]></description>
		<wfw:commentRss>http://alexkr.com/memos/358/portable-64-bit-integer-type/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The IP slash notation</title>
		<link>http://alexkr.com/memos/345/ip-slash-notation/</link>
		<comments>http://alexkr.com/memos/345/ip-slash-notation/#comments</comments>
		<pubDate>Tue, 30 Mar 2010 21:04:24 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[networking]]></category>

		<guid isPermaLink="false">http://alexkr.com/?p=345</guid>
		<description><![CDATA[How often you see something like this:

    192.168.255.0/24

For those of us who do not frequently configure IP networks such notation may seem tricky and it has nothing to do with URI(s), ports and etc.
This is a &#8220;slash&#8221; notation which is formally called Classless Inter-Domain Routing (CIDR) notation.
It allows you to specify the [...]]]></description>
		<wfw:commentRss>http://alexkr.com/memos/345/ip-slash-notation/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Current state of SCTP</title>
		<link>http://alexkr.com/memos/156/sctp-on-windows/</link>
		<comments>http://alexkr.com/memos/156/sctp-on-windows/#comments</comments>
		<pubDate>Fri, 05 Mar 2010 14:13:48 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[networking]]></category>
		<category><![CDATA[protocols]]></category>

		<guid isPermaLink="false">http://alexkr.com/memos/156/using-sctp-for-better-reliability/</guid>
		<description><![CDATA[SCTP is a relatively new protocol which may replace TCP for some applications which require more reliability. ]]></description>
		<wfw:commentRss>http://alexkr.com/memos/156/sctp-on-windows/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Matrix multiplication explained</title>
		<link>http://alexkr.com/memos/143/matrix-multiplication-explained/</link>
		<comments>http://alexkr.com/memos/143/matrix-multiplication-explained/#comments</comments>
		<pubDate>Sun, 08 Feb 2009 10:03:24 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[algorithms]]></category>

		<guid isPermaLink="false">http://alexkr.com/memos/143/matrix-multiplication-explained/</guid>
		<description><![CDATA[Finally after a big pause I am continuing to update my blog.
Several months ago I have written a short example of cache efficient matrix multiplication.
However, in the world of high performance computers such implementation would suffer in several ways.
Those who implement linear algebra applications on supercomputers are using highly optimized libraries like LaPACK, IntelMKL and [...]]]></description>
		<wfw:commentRss>http://alexkr.com/memos/143/matrix-multiplication-explained/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Cache efficient matrix multiplication</title>
		<link>http://alexkr.com/source-code/140/cache-efficient-matrix-multiplication/</link>
		<comments>http://alexkr.com/source-code/140/cache-efficient-matrix-multiplication/#comments</comments>
		<pubDate>Wed, 04 Jun 2008 15:24:35 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[c]]></category>

		<guid isPermaLink="false">http://alexkr.com/source-code/140/cache-efficient-matrix-multiplication/</guid>
		<description><![CDATA[Regardless of cache coherency problem in multithreaded environment one must think about cache efficiency when operating on various memory locations.

It is amazing how good cache efficient code performs.
As a classical example there is matrix multiplication problem.
When values are stored in memory in row major form you have good sequential access to the elements inside one [...]]]></description>
		<wfw:commentRss>http://alexkr.com/source-code/140/cache-efficient-matrix-multiplication/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Intuitive understanding of ODE solvers</title>
		<link>http://alexkr.com/source-code/127/intuitive-understanding-of-ode-solvers/</link>
		<comments>http://alexkr.com/source-code/127/intuitive-understanding-of-ode-solvers/#comments</comments>
		<pubDate>Tue, 27 Nov 2007 17:35:28 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[blah-blah]]></category>
		<category><![CDATA[code]]></category>
		<category><![CDATA[algorithms]]></category>

		<guid isPermaLink="false">http://alexkr.com/source-code/127/intuitive-understanding-of-ode-solvers/</guid>
		<description><![CDATA[There are explicit and implicit numerical solvers for ODE initial value problem.
When one solves initial value problem (or Cauchy problem) for ordinary differential equations (ODE) numerically that means we get a sequence of approximated function values y(n) starting with fist given value y(0) for a given interval and with a given discretization rate (timestep).


 dy/dx [...]]]></description>
		<wfw:commentRss>http://alexkr.com/source-code/127/intuitive-understanding-of-ode-solvers/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Session establishment in MRCP v.2</title>
		<link>http://alexkr.com/memos/126/session-establishment-in-mrcp-v2/</link>
		<comments>http://alexkr.com/memos/126/session-establishment-in-mrcp-v2/#comments</comments>
		<pubDate>Sat, 17 Nov 2007 12:22:07 +0000</pubDate>
		<dc:creator>Alex</dc:creator>
				<category><![CDATA[big]]></category>
		<category><![CDATA[networking]]></category>
		<category><![CDATA[protocols]]></category>

		<guid isPermaLink="false">http://alexkr.com/memos/126/session-establishment-in-mrcp-v2/</guid>
		<description><![CDATA[There are no MRCP communications before SIP session is established. In order to create SIP session a client must send SIP INVITE and assign at least one control stream. The following example shows SDP parameters for SIP INVITE which is send by a client to establish MRCP control media session and audio stream to the [...]]]></description>
		<wfw:commentRss>http://alexkr.com/memos/126/session-establishment-in-mrcp-v2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

