Sciweavers

16128 search results - page 485 / 3226
» Distributed network scheduling
Sort
View
156
Voted
IPPS
2003
IEEE
15 years 11 months ago
The Maximal Utilization of Processor Co-Allocation in Multicluster Systems
In systems consisting of multiple clusters of processors which employ space sharing for scheduling jobs, such as our Distributed ASCI1 Supercomputer (DAS), coallocation, i.e., the...
Anca I. D. Bucur, Dick H. J. Epema
JCIT
2007
98views more  JCIT 2007»
15 years 6 months ago
Load Indices on Heterogeneous Systems- Past, Present and Future
To achieve superior performance levels when working with heterogeneous distributed platforms, processscheduling decisions must be based essentially on the platform’s features an...
Kalinka Regina Lucas Jaquie Castelo Branco, Edward...
154
Voted
JOIN
2007
96views more  JOIN 2007»
15 years 6 months ago
Universal Routing and Performance Assurance for Distributed Networks
In this paper, we show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. W...
Kevin F. Chen, Edwin Hsing-Mean Sha
IWSOC
2005
IEEE
133views Hardware» more  IWSOC 2005»
15 years 11 months ago
Design Mapping, and Simulations of a 3G WCDMA/FDD Basestation Using Network on Chip
This paper presents a case study of a single-chip 3G WCDMA/FDD basestation implementation based on a circuit-switched network on chip. As the amount of transistors on a chip conti...
Daniel Wiklund, Dake Liu
AHSWN
2010
177views more  AHSWN 2010»
15 years 6 months ago
Dynamic Point Coverage Problem in Wireless Sensor Networks: A Cellular Learning Automata Approach
One way to prolong the lifetime of a wireless sensor network is to schedule the active times of sensor nodes, so that a node is active only when it is really needed. In the dynami...
Mehdi Esnaashari, Mohammad Reza Meybodi