Concurrency-related refactorings for JDT

From Eclipsepedia

Revision as of 15:06, 22 April 2008 by B.muskalla.gmx.net (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Project Lead: Benjamin Muskalla (IRC: benny`work)

Mentor: Kim Horne (IRC: Pookzilla)

This project is part of the Google Summer of Code 2007

Abstract

Prices of multi-core cpus are dropping and the move of multi-core processors to desktop machines doesn't stand still. There is a growing need of software developers to handle with concurrency-related problems in their application in order to improve the scalability. Today Moore's law is not applicable in the original sense as parallel computing increases. This idea growed up out of these reasons. Todays developers are all aware of the complexity of concurrent development but cannot handle this complexity very well. In many cases it's not possible to detect such problems with static or dynamic code analysis which implies that developers need to take care of it. The main idea of this project is not to solve concurrency problems but to help the developer to concentrate on the real hard things and eliminate the machine-solvable problems.


Primary goals

Legend

Glass.gif Needs some investigation

Progress.gif Work in progress

Ok green.gif Bug fixed / Feature added