Sciweavers

1502 search results - page 153 / 301
» Node weighted scheduling
Sort
View
BSDCON
2003
15 years 5 months ago
Building a High-performance Computing Cluster Using FreeBSD
In this paper we discuss the design and implementation of Fellowship, a 300+ CPU, general use computing cluster based on FreeBSD. We address the design features including configu...
Brooks Davis, Michael AuYeung, Gary Green, Craig A...
93
Voted
NIPS
2003
15 years 4 months ago
An Iterative Improvement Procedure for Hierarchical Clustering
We describe a procedure which finds a hierarchical clustering by hillclimbing. The cost function we use is a hierarchical extension of the  -means cost; our local moves are tree...
David Kauchak, Sanjoy Dasgupta
138
Voted
ECML
2004
Springer
15 years 9 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
ICCAD
2007
IEEE
160views Hardware» more  ICCAD 2007»
16 years 13 days ago
Approximation algorithm for the temperature-aware scheduling problem
— The paper addresses the problem of performance optimization for a set of periodic tasks with discrete voltage/frequency states under thermal constraints. We prove that the prob...
Sushu Zhang, Karam S. Chatha
136
Voted
FMCAD
2007
Springer
15 years 9 months ago
Modeling Time-Triggered Protocols and Verifying Their Real-Time Schedules
Time-triggered systems are distributed systems in which the nodes are independently-clocked but maintain synchrony with one another. Time-triggered protocols depend on the synchro...
Lee Pike