109 search results - page 8 / 22 » Convex programming for scheduling unrelated parallel machine... |
128
click to vote
PDP
2009
IEEE
15 years 8 months ago
2009
IEEE
—Multicore machines are becoming common. There are many languages, language extensions and libraries devoted to improve the programmability and performance of these machines. In ...
132
click to vote
ISCA
1993
IEEE
15 years 5 months ago
1993
IEEE
er uses an abstract machine approach to compare the mechanisms of two parallel machines: the J-Machine and the CM-5. High-level parallel programs are translated by a single optimi...
110
click to vote
FPL
2001
Springer
15 years 5 months ago
2001
Springer
This paper presents new achievements on the automatic mapping of algorithms, written in imperative software programming languages, to custom computing machines. The reconfigurable ...
130
click to vote
PPOPP
2009
ACM
16 years 1 months ago
2009
ACM
The efficient mapping of program parallelism to multi-core processors is highly dependent on the underlying architecture. This paper proposes a portable and automatic compiler-bas...
115
click to vote
SAGT
2009
Springer
15 years 8 months ago
2009
Springer
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...