<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/gron"><title>BibSonomy bookmarks for /user/gron</title><link>https://www.bibsonomy.org/user/gron</link><description>BibSonomy RSS Feed for /user/gron</description><items><rdf:Seq><rdf:li rdf:resource="http://existentialtype.wordpress.com/2011/03/17/parallelism-is-not-concurrency/"/><rdf:li rdf:resource="http://andreasgal.wordpress.com/2010/10/13/compartments/"/><rdf:li rdf:resource="http://blogs.msdn.com/b/codeanalysis/archive/2007/11/20/maintainability-index-range-and-meaning.aspx"/><rdf:li rdf:resource="http://blogs.sun.com/jrose/entry/larval_objects_in_the_vm"/><rdf:li rdf:resource="http://blogs.sun.com/dave/entry/a_race_in_locksupport_park"/><rdf:li rdf:resource="http://luaforge.net/docman/view.php/83/98/ANoFrillsIntroToLua51VMInstructions.pdf"/><rdf:li rdf:resource="http://www.linux-mag.com/cache/7373/1.html"/><rdf:li rdf:resource="http://www.linuxjournal.com/article/6799"/><rdf:li rdf:resource="http://software.intel.com/en-us/articles/intel-64-architecture-processor-topology-enumeration/"/><rdf:li rdf:resource="http://www.ibm.com/developerworks/java/library/j-benchmark1.html"/><rdf:li rdf:resource="http://www.ibm.com/developerworks/power/library/pa-fpfeib/"/><rdf:li rdf:resource="http://techresearch.intel.com/articles/Tera-Scale/1514.htm"/><rdf:li rdf:resource="http://www.ajaxonomy.com/2008/news/toward-better-concurrency"/><rdf:li rdf:resource="http://users.jyu.fi/~koskinen/smcosts.htm"/><rdf:li rdf:resource="http://www.icbl.hw.ac.uk/ltdi/cookbook/info_likert_scale/index.html"/><rdf:li rdf:resource="http://www.memorymanagement.org/bib/gc.html"/><rdf:li rdf:resource="http://developers.sun.com/learning/javaoneonline/sessions/2008/watch/TS-5169/index.html"/><rdf:li rdf:resource="https://maxine.dev.java.net/"/><rdf:li rdf:resource="http://de.youtube.com/watch?v=ptjedOZEXPM"/><rdf:li rdf:resource="http://wwwiti.cs.uni-magdeburg.de/iti_db/forschung/fop/featurec/"/></rdf:Seq></items></channel><item rdf:about="http://existentialtype.wordpress.com/2011/03/17/parallelism-is-not-concurrency/"><title>Parallelism is not concurrency</title><description>In an earlier post I mentioned that one goal of the new introductory curriculum at Carnegie Mellon is to teach parallelism as the general case of computing, rather than an esoteric, specialized subject for advanced students.  Many people are incredulous when I tell them this, because it immediately conjures in their mind the myriad complexities…</description><link>http://existentialtype.wordpress.com/2011/03/17/parallelism-is-not-concurrency/</link><dc:creator>gron</dc:creator><dc:date>2013-02-01T12:07:30+01:00</dc:date><dc:subject>concurrency definition distinction parallelism </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;In an earlier post I mentioned that one goal of the new introductory curriculum at Carnegie Mellon is to teach parallelism as the general case of computing, rather than an esoteric, specialized subject for advanced students.  Many people are incredulous when I tell them this, because it immediately conjures in their mind the myriad complexities…&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurrency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/definition"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/distinction"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/parallelism"/></rdf:Bag></taxo:topics></item><item rdf:about="http://andreasgal.wordpress.com/2010/10/13/compartments/"><title>Compartments « Andreas Gal</title><description>Discusses a way to separate/split the object heaps of browsers windows. Related to encapsulation and locality.</description><link>http://andreasgal.wordpress.com/2010/10/13/compartments/</link><dc:creator>gron</dc:creator><dc:date>2010-10-14T12:37:51+02:00</dc:date><dc:subject>compartments encapsulation firefox heap javascript locality objects wrapper </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Discusses a way to separate/split the object heaps of browsers windows. Related to encapsulation and locality.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/compartments"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/encapsulation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/firefox"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/heap"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/javascript"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/locality"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/objects"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wrapper"/></rdf:Bag></taxo:topics></item><item rdf:about="http://blogs.msdn.com/b/codeanalysis/archive/2007/11/20/maintainability-index-range-and-meaning.aspx"><title>Maintainability Index Range and Meaning - Code Analysis Team Blog - Site Home - MSDN Blogs</title><description></description><link>http://blogs.msdn.com/b/codeanalysis/archive/2007/11/20/maintainability-index-range-and-meaning.aspx</link><dc:creator>gron</dc:creator><dc:date>2010-10-07T16:29:45+02:00</dc:date><dc:subject>CodeAnalysis Complexity Evaluation Halstead McCabe Metrics VisualStudio2008 code </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2010-10-07T16:29:45+02:00&#034; href=&#034;http://blogs.msdn.com/b/codeanalysis/archive/2007/11/20/maintainability-index-range-and-meaning.aspx&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://blogs.msdn.com/b/codeanalysis/archive/2007/11/20/maintainability-index-range-and-meaning.aspx&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/CodeAnalysis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Complexity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Evaluation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Halstead"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/McCabe"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Metrics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/VisualStudio2008"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/code"/></rdf:Bag></taxo:topics></item><item rdf:about="http://blogs.sun.com/jrose/entry/larval_objects_in_the_vm"><title>larval objects in the VM : John Rose @ Oracle</title><description></description><link>http://blogs.sun.com/jrose/entry/larval_objects_in_the_vm</link><dc:creator>gron</dc:creator><dc:date>2010-10-05T10:06:55+02:00</dc:date><dc:subject>Concurrency Encapsulation Immutability Larval Larves Types Typing </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2010-10-05T10:06:55+02:00&#034; href=&#034;http://blogs.sun.com/jrose/entry/larval_objects_in_the_vm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://blogs.sun.com/jrose/entry/larval_objects_in_the_vm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Concurrency"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Encapsulation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Immutability"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Larval"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Larves"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Types"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Typing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://blogs.sun.com/dave/entry/a_race_in_locksupport_park"><title>A race in LockSupport park() arising from weak memory models</title><description>I recently diagnosed the root cause of a concurrency bug, CR6822370, 
and thought it sufficiently interesting to share the details. (CR 6822370 actually represents a 
cluster of bugs that are now thought to be related by a common underlying issue). 
Briefly, we have a lost wakeup bug in the native C++ Parker::park() platform-specific 
infrastructure code that implements java.util.concurrent.LockSupport.park(). 
The lost wakeup arises from a race that itself arises because of architectural 
reordering that in turn occurs because of missing memory barrier instructions. 
The lost wakeup may manifest as various &#039;hangs&#039; or instances of progress failure.</description><link>http://blogs.sun.com/dave/entry/a_race_in_locksupport_park</link><dc:creator>gron</dc:creator><dc:date>2009-12-12T20:32:54+01:00</dc:date><dc:subject>LostUpdate MemoryModel RaceCondition Threads bug example fences java weak </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;I recently diagnosed the root cause of a concurrency bug, CR6822370, 
and thought it sufficiently interesting to share the details. (CR 6822370 actually represents a 
cluster of bugs that are now thought to be related by a common underlying issue). 
Briefly, we have a lost wakeup bug in the native C++ Parker::park() platform-specific 
infrastructure code that implements java.util.concurrent.LockSupport.park(). 
The lost wakeup arises from a race that itself arises because of architectural 
reordering that in turn occurs because of missing memory barrier instructions. 
The lost wakeup may manifest as various &amp;#039;hangs&amp;#039; or instances of progress failure.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/LostUpdate"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/MemoryModel"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/RaceCondition"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Threads"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bug"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/example"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fences"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/weak"/></rdf:Bag></taxo:topics></item><item rdf:about="http://luaforge.net/docman/view.php/83/98/ANoFrillsIntroToLua51VMInstructions.pdf"><title>A No-Frills Introduction to Lua 5.1 VM Instructions</title><description>by Kein-Hong Man
Version 0.1, 20060313</description><link>http://luaforge.net/docman/view.php/83/98/ANoFrillsIntroToLua51VMInstructions.pdf</link><dc:creator>gron</dc:creator><dc:date>2009-10-04T17:44:55+02:00</dc:date><dc:subject>Bytecode InstructionSet Lua </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;by Kein-Hong Man
Version 0.1, 20060313&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Bytecode"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/InstructionSet"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Lua"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.linux-mag.com/cache/7373/1.html"><title>Why Parrot is Important | Linux Magazine</title><description>Think writing a compiler is difficult? It is—unless you use Parrot, a complete compiler construction kit. With Parrot, crafting a new programming language is as easy as authoring a new website.</description><link>http://www.linux-mag.com/cache/7373/1.html</link><dc:creator>gron</dc:creator><dc:date>2009-07-10T17:47:50+02:00</dc:date><dc:subject>Compiler Language NoEvaluation Parrot Perl VM </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Think writing a compiler is difficult? It is—unless you use Parrot, a complete compiler construction kit. With Parrot, crafting a new programming language is as easy as authoring a new website.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Compiler"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Language"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/NoEvaluation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Parrot"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Perl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/VM"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.linuxjournal.com/article/6799"><title>CPU Affinity</title><description></description><link>http://www.linuxjournal.com/article/6799</link><dc:creator>gron</dc:creator><dc:date>2009-04-28T15:09:51+02:00</dc:date><dc:subject>affinity core cpu linux </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2009-04-28T15:09:51+02:00&#034; href=&#034;http://www.linuxjournal.com/article/6799&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.linuxjournal.com/article/6799&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/affinity"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/core"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cpu"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/linux"/></rdf:Bag></taxo:topics></item><item rdf:about="http://software.intel.com/en-us/articles/intel-64-architecture-processor-topology-enumeration/"><title>Intel® 64 Architecture Processor Topology Enumeration - Intel® Software Network</title><description></description><link>http://software.intel.com/en-us/articles/intel-64-architecture-processor-topology-enumeration/</link><dc:creator>gron</dc:creator><dc:date>2009-04-28T14:43:45+02:00</dc:date><dc:subject>caches cores topolog </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2009-04-28T14:43:45+02:00&#034; href=&#034;http://software.intel.com/en-us/articles/intel-64-architecture-processor-topology-enumeration/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://software.intel.com/en-us/articles/intel-64-architecture-processor-topology-enumeration/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/caches"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cores"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/topolog"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.ibm.com/developerworks/java/library/j-benchmark1.html"><title>Robust Java benchmarking, Part 1: Issues</title><description>Program performance is always a concern, even in this era of high-performance hardware. This article, the first in a two-part series, guides you around the many pitfalls associated with benchmarking Java code. Part 2 covers the statistics of benchmarking and offers a framework for performing Java benchmarking. Because almost all new languages are virtual machine-based, the general principles the article describes have broad significance for the programming community at large.</description><link>http://www.ibm.com/developerworks/java/library/j-benchmark1.html</link><dc:creator>gron</dc:creator><dc:date>2009-04-25T10:59:06+02:00</dc:date><dc:subject>Java benchmarking </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Program performance is always a concern, even in this era of high-performance hardware. This article, the first in a two-part series, guides you around the many pitfalls associated with benchmarking Java code. Part 2 covers the statistics of benchmarking and offers a framework for performing Java benchmarking. Because almost all new languages are virtual machine-based, the general principles the article describes have broad significance for the programming community at large.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Java"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/benchmarking"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.ibm.com/developerworks/power/library/pa-fpfeib/"><title>Just like being there: Papers from the Fall Processor Forum 2005: Unleashing the Cell Broadband Engine Processor: Element Interconnect Bus</title><description></description><link>http://www.ibm.com/developerworks/power/library/pa-fpfeib/</link><dc:creator>gron</dc:creator><dc:date>2009-03-04T17:32:01+01:00</dc:date><dc:subject>Cell </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2009-03-04T17:32:01+01:00&#034; href=&#034;http://www.ibm.com/developerworks/power/library/pa-fpfeib/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.ibm.com/developerworks/power/library/pa-fpfeib/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Cell"/></rdf:Bag></taxo:topics></item><item rdf:about="http://techresearch.intel.com/articles/Tera-Scale/1514.htm"><title>Ct: C for Throughput Computing</title><description></description><link>http://techresearch.intel.com/articles/Tera-Scale/1514.htm</link><dc:creator>gron</dc:creator><dc:date>2008-10-15T22:59:18+02:00</dc:date><dc:subject>Intel Me:ToRead concurreny </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-10-15T22:59:18+02:00&#034; href=&#034;http://techresearch.intel.com/articles/Tera-Scale/1514.htm&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://techresearch.intel.com/articles/Tera-Scale/1514.htm&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Intel"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Me:ToRead"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurreny"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.ajaxonomy.com/2008/news/toward-better-concurrency"><title>Toward Better Concurrency | Ajaxonomy</title><description></description><link>http://www.ajaxonomy.com/2008/news/toward-better-concurrency</link><dc:creator>gron</dc:creator><dc:date>2008-09-25T19:11:24+02:00</dc:date><dc:subject>Me:ToRead PhD concurrency </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-09-25T19:11:24+02:00&#034; href=&#034;http://www.ajaxonomy.com/2008/news/toward-better-concurrency&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.ajaxonomy.com/2008/news/toward-better-concurrency&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Me:ToRead"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/PhD"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/concurrency"/></rdf:Bag></taxo:topics></item><item rdf:about="http://users.jyu.fi/~koskinen/smcosts.htm"><title>Software maintenance costs</title><description>Software Maintenance Costs</description><link>http://users.jyu.fi/~koskinen/smcosts.htm</link><dc:creator>gron</dc:creator><dc:date>2008-07-29T21:40:44+02:00</dc:date><dc:subject>Costs Maintenance Software </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Software Maintenance Costs&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Costs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Maintenance"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Software"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.icbl.hw.ac.uk/ltdi/cookbook/info_likert_scale/index.html"><title>Likert scale information page</title><description></description><link>http://www.icbl.hw.ac.uk/ltdi/cookbook/info_likert_scale/index.html</link><dc:creator>gron</dc:creator><dc:date>2008-07-26T12:10:23+02:00</dc:date><dc:subject>Likert Me:MastersThesis Me:ToRead scale </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-07-26T12:10:23+02:00&#034; href=&#034;http://www.icbl.hw.ac.uk/ltdi/cookbook/info_likert_scale/index.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.icbl.hw.ac.uk/ltdi/cookbook/info_likert_scale/index.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Likert"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Me:MastersThesis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Me:ToRead"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/scale"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.memorymanagement.org/bib/gc.html"><title>The Memory Management Reference: Bibliography: By GC Technique</title><description></description><link>http://www.memorymanagement.org/bib/gc.html</link><dc:creator>gron</dc:creator><dc:date>2008-07-14T20:08:07+02:00</dc:date><dc:subject>GC Me:MastersThesis VM memory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-07-14T20:08:07+02:00&#034; href=&#034;http://www.memorymanagement.org/bib/gc.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.memorymanagement.org/bib/gc.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/GC"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Me:MastersThesis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/VM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/memory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://developers.sun.com/learning/javaoneonline/sessions/2008/watch/TS-5169/index.html"><title>THE MAXINE VIRTUAL MACHINE</title><description></description><link>http://developers.sun.com/learning/javaoneonline/sessions/2008/watch/TS-5169/index.html</link><dc:creator>gron</dc:creator><dc:date>2008-07-08T17:59:21+02:00</dc:date><dc:subject>Maxine Me:MastersThesis Slides Talk VM </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-07-08T17:59:21+02:00&#034; href=&#034;http://developers.sun.com/learning/javaoneonline/sessions/2008/watch/TS-5169/index.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://developers.sun.com/learning/javaoneonline/sessions/2008/watch/TS-5169/index.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Maxine"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Me:MastersThesis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Slides"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Talk"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/VM"/></rdf:Bag></taxo:topics></item><item rdf:about="https://maxine.dev.java.net/"><title>maxine: Maxine VM</title><description></description><link>https://maxine.dev.java.net/</link><dc:creator>gron</dc:creator><dc:date>2008-07-01T18:00:24+02:00</dc:date><dc:subject>Me:MastersThesis RelatedWork </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-07-01T18:00:24+02:00&#034; href=&#034;https://maxine.dev.java.net/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;https://maxine.dev.java.net/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Me:MastersThesis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/RelatedWork"/></rdf:Bag></taxo:topics></item><item rdf:about="http://de.youtube.com/watch?v=ptjedOZEXPM"><title>YouTube - Google I/O 2008 - Dalvik Virtual Machine Internals</title><description>Some good ideas about optimizations and tradeoffs for embedded VMs, might be worth to discuss in the Thesis</description><link>http://de.youtube.com/watch?v=ptjedOZEXPM</link><dc:creator>gron</dc:creator><dc:date>2008-06-20T11:15:05+02:00</dc:date><dc:subject>Dalvik Me:MastersThesis Optimization Requirements VM embedded </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Some good ideas about optimizations and tradeoffs for embedded VMs, might be worth to discuss in the Thesis&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Dalvik"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Me:MastersThesis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Optimization"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Requirements"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/VM"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/embedded"/></rdf:Bag></taxo:topics></item><item rdf:about="http://wwwiti.cs.uni-magdeburg.de/iti_db/forschung/fop/featurec/"><title>FeatureC++: Feature-Oriented and Aspect-Oriented Programming in C++</title><description></description><link>http://wwwiti.cs.uni-magdeburg.de/iti_db/forschung/fop/featurec/</link><dc:creator>gron</dc:creator><dc:date>2008-06-19T19:21:02+02:00</dc:date><dc:subject>Me:MastersThesis feature-oriented programming </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2008-06-19T19:21:02+02:00&#034; href=&#034;http://wwwiti.cs.uni-magdeburg.de/iti_db/forschung/fop/featurec/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://wwwiti.cs.uni-magdeburg.de/iti_db/forschung/fop/featurec/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Me:MastersThesis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/feature-oriented"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming"/></rdf:Bag></taxo:topics></item></rdf:RDF>