Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

WOTUG
2008

favoriteEmaildiscussreport

136views Computer Science» more WOTUG 2008»

Solving the Santa Claus Problem: a Comparison of Various Concurrent Programming Techniques

13 years 6 months ago

Solving the Santa Claus Problem: a Comparison of Various Concurrent Programming Techniques

Download www.egr.unlv.edu

Abstract. The Santa Claus problem provides an excellent exercise in concurrent programming and can be used to show the simplicity or complexity of solving problems using a particular set of concurrency mechanisms and offers a comparison of these mechanisms. Shared-memory constructs, message passing constructs, and process oriented constructs will be used in various programming languages to solve the Santa Claus Problem. Various concurrency mechanisms available will be examined and analyzed as to their respective strengths and weaknesses. Keywords. concurrency, distributed memory, shared memory, process-oriented programming.

Jason Hurt, Jan Bækgaard Pedersen

Real-time Traffic

Computer Science | Concurrency Mechanisms | Santa Claus Problem | Various Concurrency Mechanisms | WOTUG 2008 |

claim paper

Related Content

» The Santa Claus problem

» Kima An Automated Error Correction System for Concurrent Logic Programs

» A Practical Efficient Fptas for the 01 Multiobjective Knapsack Problem

» Pueblo A Hybrid PseudoBoolean SAT Solver

» Why Not Use a PatternBased Parallel Programming System

» Generic ILP versus specialized 01 ILP an update

» Comparison of Multiobjective Evolutionary Algorithms Empirical Results

» Narrowing and Rewriting Logic from Foundations to Applications

» Group mutual exclusion in Olog n RMR

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	WOTUG
Authors	Jason Hurt, Jan Bækgaard Pedersen

Comments (0)