jump to navigation

Can We Abstract Away from Multiple Cores in Coding? March 14, 2010

Posted by Peter Varhol in Architectures, Software development, Software platforms.

Readers know that I’m very interested in how software developers are adapting to programming for multi-core systems.  Traditional programs are written to be single-threaded, in that they execute code sequentially.  Taking advantage of multiple cores, and multiple processors in individual systems, is a technically difficult endeavor that most application programmers don’t even attempt.

You might think that it is easy; Web applications with multiple simultaneous users do it all the time, right?  Um, not necessarily.  In some cases, the underlying application server can dispatch multiple threads which may be scheduled on different cores, but those threads clearly have to be independent so that there is no possibility of a race condition or other multiprocessing error.

My friends at 1060 Research are releasing some interesting benchmark results on the scalability of the company’s NetKernel framework.  NetKernel practices what 1060 Research calls Resource-Oriented Computing, a type of Representational State Transfer, or REST.  In a nutshell, everything that constitutes an application is considered and treated as a resource, accessible through a URI.

The benchmark results, which can be found here, are fascinating from the standpoint of multi-core programming.  They demonstrate that NetKernel response time scales linearly across processors and cores as workload increases.  This immediately indicates that NetKernel can make effective use of multi-processor and multi-core systems, without the need for developers to do anything different.  That, in my mind, is a very big thing.

The other interesting point that the 1060 Research folks make is the linearly scaling in and of itself.  Performance degrades very predictably once the system is fully utilized (at close to 100 percent CPU utilization and throughput).

I asked Randy Kahle of 1060 Research about how response time can scale linearly with a fully loaded system.  His response: “This is actually a key finding. The response time is constant as long as there is a core waiting to process the request. Once cores are saturated then their availability is smoothly allocated to requests. The fact that this is linear shows that there is a smooth allocation of work.”

What does this mean for users of large-scale multi-processor and multi-core servers?  NetKernel takes care of what appears to be an efficient allocation of workload between CPUs and cores.  This isn’t quite the same as writing multi-core code within the context of a single application, but it’s the next-best thing.



1. A Maturity Model for Measuring Nonprofit Organizational … | DevBlogr - March 22, 2010

[…] Can We Abstract Away from Multiple Cores in Coding? « Cutting Edge … […]

2. How Many Processor Cores are Enough? « Cutting Edge Computing - March 31, 2010

[…] may come in time.  Software such as Netkernel can sit between the application and OS, and take care of dispatching threads efficiently.  These […]

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: