71 search results - page 7 / 15 » Improved Approximations for Multiprocessor Scheduling Under ... |
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
Recently, under a fixed power budget, asymmetric multiprocessors (AMP) have been proposed to improve the performance of multi-threaded applications compared to symmetric multiproc...
JCSS
2007
13 years 8 months ago
2007
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
SPAA
2003
ACM
14 years 1 months ago
2003
ACM
In the classical load balancing or multiprocessor scheduling problem, we are given a sequence of jobs of varying sizes and are asked to assign each job to one of the m empty proce...
WINET
2010
13 years 7 months ago
2010
In this paper we consider how to collect data from sensors deployed in the Euclidean plane in a timeefficient way. We assume that all sensors could adjust their transmission range...
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
The pre-computation of data cubes is critical to improving the response time of On-Line Analytical Processing (OLAP) systems and can be instrumental in accelerating data mining tas...