Sciweavers

10106 search results - page 402 / 2022
» Algorithm Selection and Scheduling
Sort
View
RTAS
2007
IEEE
16 years 1 months ago
Real-Time Divisible Load Scheduling for Cluster Computing
Cluster computing has emerged as a new paradigm for solving large-scale problems. To enhance QoS and provide performance guarantees in cluster computing environments, various real...
Xuan Lin, Ying Lu, Jitender S. Deogun, Steve Godda...
IPPS
2000
IEEE
15 years 11 months ago
Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
Ajoy Kumar Datta, Maria Gradinariu, Sébasti...
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
15 years 10 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht
206
Voted
AINA
2010
IEEE
15 years 7 months ago
Schedule Distributed Virtual Machines in a Service Oriented Environment
—Virtual machines offer unique advantages to the scientific computing community, such as Quality of Service(QoS) guarantee, performance isolation, easy resource management, and ...
Lizhe Wang, Gregor von Laszewski, Marcel Kunze, Ji...
WEBI
2005
Springer
16 years 8 days ago
Improving Web Clustering by Cluster Selection
Web page clustering is a technology that puts semantically related web pages into groups and is useful for categorizing, organizing, and refining search results. When clustering ...
Daniel Crabtree, Xiaoying Gao, Peter Andreae