Sciweavers

2800 search results - page 252 / 560
» Scaling RDF with time
Sort
View
3PGCIC
2010
15 years 4 months ago
Using a Failure History Service for Reliable Grid Node Information
The need for reliability in Grid Systems is a difficult challenge which is very important in the context of highly dynamic systems composed of thousands of nodes. Failure manageme...
Catalin Leordeanu, Valentin Cristea, Thomas Ropars...
JSSPP
2010
Springer
15 years 4 months ago
Dynamic Proportional Share Scheduling in Hadoop
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mech...
Thomas Sandholm, Kevin Lai
JDCTA
2010
130views more  JDCTA 2010»
15 years 1 months ago
A Search Algorithm for Clusters in a Network or Graph
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
Dongming Chen, Jing Wang, Xiaodong Chen, Xiaowei X...
DAC
2011
ACM
14 years 6 months ago
Throughput maximization for periodic real-time systems under the maximal temperature constraint
We study the problem on how to maximize the throughput for a periodic real-time system under the given peak temperature constraint. We assume that different tasks in our system ma...
Huang Huang, Gang Quan, Jeffrey Fan, Meikang Qiu
201
Voted
FSTTCS
1998
Springer
15 years 11 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif