Sciweavers

1952 search results - page 90 / 391
» Complete partitions of graphs
Sort
View
126
Voted
IPPS
1999
IEEE
15 years 8 months ago
Deterministic Batch Scheduling without Static Partitioning
The Irix 6.5 scheduling system provides intrinsic support for batch processing, including support for guaranteed access to resources and policy-based static scheduling. Long range ...
Kostadis Roussos, Nawaf Bitar, Robert English
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
15 years 9 months ago
Modeling the Search Landscape of Metaheuristic Software Clustering Algorithms
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
Brian S. Mitchell, Spiros Mancoridis
151
Voted
ICCAD
1999
IEEE
115views Hardware» more  ICCAD 1999»
15 years 8 months ago
Fast performance analysis of bus-based system-on-chip communication architectures
This paper addresses the problem of efficient and accurate performance analysis to drive the exploration and design of bus-based System-on-Chip (SOC) communication architectures. ...
Kanishka Lahiri, Anand Raghunathan, Sujit Dey
ECRTS
2010
IEEE
15 years 5 months ago
Partitioning Parallel Applications on Multiprocessor Reservations
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...
Giorgio C. Buttazzo, Enrico Bini, Yifan Wu
195
Voted
CORR
2011
Springer
268views Education» more  CORR 2011»
14 years 7 months ago
Approximation Algorithms for Submodular Multiway Partition
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
Chandra Chekuri, Alina Ene