Sciweavers

187 search results - page 17 / 38
» Adding parallelism to visual data flow programs
Sort
View
124
Voted
DCOSS
2006
Springer
15 years 6 months ago
An Optimal Data Propagation Algorithm for Maximizing the Lifespan of Sensor Networks
We consider the problem of data propagation in wireless sensor networks and revisit the family of mixed strategy routing schemes. We show that maximizing the lifespan, balancing th...
Aubin Jarry, Pierre Leone, Olivier Powell, Jos&eac...
100
Voted
IPPS
2000
IEEE
15 years 6 months ago
Enhancing NWS for Use in an SNMP Managed Internetwork
The Network Weather Service NWS is a distributed resource monitoring and utilization prediction system, employed as an aid to scheduling jobs in a metacomputing environment 9, 1...
Robert E. Busby Jr., Mitchell L. Neilsen, Daniel A...
125
Voted
IPPS
1997
IEEE
15 years 6 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...
120
Voted
CCGRID
2001
IEEE
15 years 6 months ago
OVM: Out-of-Order Execution Parallel Virtual Machine
High performance computing on parallel architectures currently uses different approaches depending on the hardory model of the architecture, the abstraction level of the programmi...
George Bosilca, Gilles Fedak, Franck Cappello
106
Voted
ASPLOS
2008
ACM
15 years 4 months ago
Concurrency control with data coloring
Concurrency control is one of the main sources of error and complexity in shared memory parallel programming. While there are several techniques to handle concurrency control such...
Luis Ceze, Christoph von Praun, Calin Cascaval, Pa...