Sciweavers

342 search results - page 13 / 69
» Automatic Generation of Heuristics for Scheduling
Sort
View
ISPAN
2002
IEEE
15 years 10 months ago
Automatic Processor Lower Bound Formulas for Array Computations
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
Peter R. Cappello, Ömer Egecioglu
IEEEPACT
2007
IEEE
16 years 1 days ago
Automatic Correction of Loop Transformations
Loop nest optimization is a combinatorial problem. Due to the growing complexity of modern architectures, it involves two increasingly difficult tasks: (1) analyzing the profita...
Nicolas Vasilache, Albert Cohen, Louis-Noël P...
IJFCS
2006
111views more  IJFCS 2006»
15 years 5 months ago
Completeness and realizability: conditions for automatic generation of workflows
In recent years, workflow technology has greatly facilitated business process modeling and reengineering in information systems. On one hand, the separation of an application'...
Shiyong Lu, Arthur J. Bernstein, Philip M. Lewis
HYBRID
2010
Springer
16 years 17 days ago
Real-time scheduling of mixture-of-experts systems with limited resources
Mixture-of-Experts (MoE) systems solve intricate problems by combining results generated independently by multiple computational models (the “experts”). Given an instance of a...
Prapaporn Rattanatamrong, José A. B. Fortes
PAAPP
2006
44views more  PAAPP 2006»
15 years 5 months ago
Revisiting communication code generation algorithms for message-passing systems
In this paper, we investigate algorithms for generating communication code to run on distributedmemory systems. We modify algorithms from previously published work and prove that ...
Clayton S. Ferner