Sciweavers

1237 search results - page 29 / 248
» Partitions and the Fermi-Dirac Distribution
Sort
View
IPPS
2007
IEEE
14 years 5 months ago
Competitive Analysis of Partitioned Scheduling on Uniform Multiprocessors
Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can b...
Björn Andersson, Eduardo Tovar
CIDR
2011
342views Algorithms» more  CIDR 2011»
13 years 2 months ago
Megastore: Providing Scalable, Highly Available Storage for Interactive Services
Megastore is a storage system developed to meet the requirements of today’s interactive online services. Megastore blends the scalability of a NoSQL datastore with the convenien...
Jason Baker, Chris Bond, James Corbett, J. J. Furm...
PE
2011
Springer
167views Optimization» more  PE 2011»
13 years 5 months ago
Passage-time computation and aggregation strategies for large semi-Markov processes
High-level semi-Markov modelling paradigms such as semi-Markov stochastic Petri nets and process algebras are used to capture realistic performance models of computer and communic...
Marcel C. Guenther, Nicholas J. Dingle, Jeremy T. ...
DCOSS
2007
Springer
14 years 5 months ago
A Connectivity Based Partition Approach for Node Scheduling in Sensor Networks
This paper presents a Connectivity based Partition Approach (CPA) to reduce the energy consumption of a sensor network by sleep scheduling among sensor nodes. CPA partitions sensor...
Yong Ding, Chen Wang, Li Xiao
IPPS
2006
IEEE
14 years 5 months ago
Reducing reconfiguration time of reconfigurable computing systems in integrated temporal partitioning and physical design framew
In reconfigurable systems, reconfiguration latency is a very important factor impact the system performance. In this paper, a framework is proposed that integrates the temporal pa...
Farhad Mehdipour, Morteza Saheb Zamani, H. R. Ahma...