Details
| Originalsprache | Englisch |
|---|---|
| Seiten | 294-303 |
| Seitenumfang | 10 |
| Publikationsstatus | Veröffentlicht - 1997 |
| Veranstaltung | 1997 IEEE International Conference on Application-Specific Systems, Architectures and Processors, ASAP'97 - Zurich, Schweiz Dauer: 14 Juli 1997 → 16 Juli 1997 |
Konferenz
| Konferenz | 1997 IEEE International Conference on Application-Specific Systems, Architectures and Processors, ASAP'97 |
|---|---|
| Land/Gebiet | Schweiz |
| Ort | Zurich |
| Zeitraum | 14 Juli 1997 → 16 Juli 1997 |
Abstract
We propose a novel stochastic approach for the problem of multiprocessor scheduling and allocation under timing and resource constraints using an evolutionary algorithm (EA). For composite schemes of DSP algorithms a compact problem encoding has been developed with emphasis on the allocation/binding part of the problem as well as an efficient problem transformation-decoding scheme in order to avoid infeasible solutions and therefore time consuming repair mechanisms. Thus, the algorithm is able to handle even large size problems within moderate computation time. Simulation results comparing the proposed EA with optimal results provided by mixed integer linear programming (MILP) show, that the EA is suitable to achieve the same or similar results but in much less time as problem size increases.
ASJC Scopus Sachgebiete
- Informatik (insg.)
- Hardware und Architektur
- Informatik (insg.)
- Computernetzwerke und -kommunikation
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
1997. 294-303 Beitrag in 1997 IEEE International Conference on Application-Specific Systems, Architectures and Processors, ASAP'97, Zurich, Schweiz.
Publikation: Konferenzbeitrag › Paper › Forschung › Peer-Review
}
TY - CONF
T1 - Heterogeneous multiprocessor scheduling and allocation using evolutionary algorithms
AU - Reuter, C.
AU - Schwiegershausen, M.
AU - Pirsch, P.
PY - 1997
Y1 - 1997
N2 - We propose a novel stochastic approach for the problem of multiprocessor scheduling and allocation under timing and resource constraints using an evolutionary algorithm (EA). For composite schemes of DSP algorithms a compact problem encoding has been developed with emphasis on the allocation/binding part of the problem as well as an efficient problem transformation-decoding scheme in order to avoid infeasible solutions and therefore time consuming repair mechanisms. Thus, the algorithm is able to handle even large size problems within moderate computation time. Simulation results comparing the proposed EA with optimal results provided by mixed integer linear programming (MILP) show, that the EA is suitable to achieve the same or similar results but in much less time as problem size increases.
AB - We propose a novel stochastic approach for the problem of multiprocessor scheduling and allocation under timing and resource constraints using an evolutionary algorithm (EA). For composite schemes of DSP algorithms a compact problem encoding has been developed with emphasis on the allocation/binding part of the problem as well as an efficient problem transformation-decoding scheme in order to avoid infeasible solutions and therefore time consuming repair mechanisms. Thus, the algorithm is able to handle even large size problems within moderate computation time. Simulation results comparing the proposed EA with optimal results provided by mixed integer linear programming (MILP) show, that the EA is suitable to achieve the same or similar results but in much less time as problem size increases.
UR - http://www.scopus.com/inward/record.url?scp=0030708495&partnerID=8YFLogxK
M3 - Paper
AN - SCOPUS:0030708495
SP - 294
EP - 303
T2 - 1997 IEEE International Conference on Application-Specific Systems, Architectures and Processors, ASAP'97
Y2 - 14 July 1997 through 16 July 1997
ER -