Sciweavers

98 search results - page 16 / 20
» Macro-op Scheduling: Relaxing Scheduling Loop Constraints
Sort
View
EMSOFT
2009
Springer
14 years 2 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu
MICRO
2002
IEEE
143views Hardware» more  MICRO 2002»
14 years 25 days ago
Effective instruction scheduling techniques for an interleaved cache clustered VLIW processor
Clustering is a common technique to overcome the wire delay problem incurred by the evolution of technology. Fully-distributed architectures, where the register file, the functio...
Enric Gibert, F. Jesús Sánchez, Anto...
CPAIOR
2004
Springer
14 years 1 months ago
A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times
Abstract. We propose a new solution approach for the Job Shop Problem with Sequence Dependent Setup Times (SDST-JSP). The problem consists in scheduling jobs, each job being a set ...
Christian Artigues, Sana Belmokhtar, Dominique Fei...
CP
2003
Springer
14 years 1 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
CAISE
2006
Springer
13 years 10 months ago
Resolving Underconstrained and Overconstrained Systems of Conjunctive Constraints for Service Requests
Given a service request such as scheduling an appointment or purchasing a product, it is possible that the invocation of the service results in too many solutions that all satisfy ...
Muhammed Al-Muhammed, David W. Embley