Sciweavers

151 search results - page 11 / 31
» A Cost Analysis of Solving the Amnesia Problems
Sort
View
TAPSOFT
1995
Springer
13 years 11 months ago
Static and Dynamic Processor Allocation for Higher-Order Concurrent Languages
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
Hanne Riis Nielson, Flemming Nielson
ATAL
2008
Springer
13 years 9 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
MJ
2006
89views more  MJ 2006»
13 years 7 months ago
RTDT: A static QoS manager, RT scheduling, HW/SW partitioning CAD tool
The Hardware (HW)/Software (SW) partitioning/scheduling relies on two subtasks : the cost function and the real time (RT) analysis. Besides these two subtasks, the proposed generi...
Hedi Tmar, Jean-Philippe Diguet, Abdenour Azzedine...
OOPSLA
2009
Springer
14 years 2 months ago
A concurrent dynamic analysis framework for multicore hardware
Software has spent the bounty of Moore’s law by solving harder problems and exploiting abstractions, such as highlevel languages, virtual machine technology, binary rewritdynami...
Jungwoo Ha, Matthew Arnold, Stephen M. Blackburn, ...
PPOPP
2005
ACM
14 years 1 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber