VERTICAL MIGRATION: AN EXPERIMENTAL STUDY OF THE CANDIDATE-SELECTION PROBLEM.

E. Luque, A. Ripoll, T. Diez

    Research output: Contribution to journalArticleResearchpeer-review

    Abstract

    Vertical migration is a technique to improve the performance of a computer system in which the selected primitives (instruction sequences or functions) are moved to a lower level in the software/firmware hierarchy. Concerning the steps to be performed to apply this technique, we have taken into account the selection problem of vertical-migration candidates. To solve the selection of these sequences which leads to the highest time saving for control-store filling, a suboptimal algorithm which considers the structural aspects (interrelationships) between the candidate sequences is presented. To validate this algorithm, it has been run over a selected high number of different sets of candidate sequences, and the results obtained show that the average deviation between the suboptimal solution and the optimal one is under 5%, and that the computer time and mmemory space required to evaluate it are drastically reduced.
    Original languageEnglish
    Pages (from-to)177-188
    JournalIEE Proceedings E: Computers and Digital Techniques
    Volume134
    Issue number4
    DOIs
    Publication statusPublished - 1 Jan 1987

    Fingerprint Dive into the research topics of 'VERTICAL MIGRATION: AN EXPERIMENTAL STUDY OF THE CANDIDATE-SELECTION PROBLEM.'. Together they form a unique fingerprint.

    Cite this