874 search results - page 40 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
106
click to vote
IPPS
1999
IEEE
15 years 5 months ago
1999
IEEE
Abstract. In this paper we suggest a strategy to design job scheduling systems. To this end, we first split a scheduling system into three components: Scheduling policy, objective ...
117
click to vote
PARLE
1987
1987
Emulating Digital Logic using Transputer Networks (very High Parallelism = Simplicity = Performance)
15 years 4 months ago
Modern VLSI technology has changed the economic rules by which the balance between processing power, memory and communications is decided in computing systems. This will have a pr...
115
click to vote
PPL
2008
15 years 1 months ago
2008
The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel compute...
108
click to vote
CDES
2006
15 years 2 months ago
2006
- Many memory-sensitive embedded applications can tolerate small performance degradations if doing so can reduce the memory space requirements significantly. This paper explores th...
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
A well-known problem in P2P systems is freeriding, where users do not share content if there is no incentive to do so. In this paper, we distinguish lazy freeriders that are merel...