Sciweavers

280 search results - page 41 / 56
» Quasi-Static Scheduling of Communicating Tasks
Sort
View
ECRTS
2007
IEEE
14 years 2 months ago
On Dominating Set Allocation Policies in Real-Time Wide-Area Distributed Systems
This paper investigates resource allocation policies for achieving real-time content distribution with subsecond delay bounds on the current Internet. Resource allocation in real-...
Chengdu Huang, Tarek F. Abdelzaher, Xue Liu
IPPS
2010
IEEE
13 years 5 months ago
Oblivious algorithms for multicores and network of processors
We address the design of algorithms for multicores that are oblivious to machine parameters. We propose HM, a multicore model consisting of a parallel shared-memory machine with hi...
Rezaul Alam Chowdhury, Francesco Silvestri, Brando...
CORR
2010
Springer
74views Education» more  CORR 2010»
13 years 7 months ago
Data Partitioning for Parallel Entity Matching
Entity matching is an important and difficult step for integrating web data. To reduce the typically high execution time for matching we investigate how we can perform entity matc...
Toralf Kirsten, Lars Kolb, Michael Hartung, Anika ...
DC
2006
13 years 7 months ago
Performing work in broadcast networks
We consider the problem of how to schedule t similar and independent tasks to be performed in a synchronous distributed system of p stations communicating via multiple-access chan...
Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Li...
ICPADS
2002
IEEE
14 years 18 days ago
Adaptive Matrix Multiplication in Heterogeneous Environments
In this paper, an adaptive matrix multiplication algorithm for dynamic heterogeneous environments is developed and evaluated. Unlike the state-of-the-art approaches, where load ba...
Bo Hong, Viktor K. Prasanna