An efficient algorithm for online placement in a reconfigurable system

Mohammad Esmaeildoust; Ali Zakerolhosseini

doi:10.1109/OPTIM.2008.4602501

An efficient algorithm for online placement in a reconfigurable system

Mohammad Esmaeildoust, Ali Zakerolhosseini

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

Partially runtime reconfiguration is an efficient method for use in the limited resources in order to increase the performance of the system. In these systems, all the processes use the reconfigurable resources and place their hardware tasks at run time without affecting each other. One of the challenging problems in online task placement is fragmentation of reconfigurable resources. This paper focuses on fragmentation rate of task placement in a reconfigurable system. Several techniques for rectangular tasks are investigated and an algorithm that decreases the fragmentation of a FPGA is presented. The algorithm is able to locate a feasible location with improvement in the fragmentation. The algorithm also produces a lower rejection rate compared to other placement algorithms.

Original language	English
Title of host publication	11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008
Pages	69-74
Number of pages	6
DOIs	https://doi.org/10.1109/OPTIM.2008.4602501
Publication status	Published - 2008
Externally published	Yes
Event	11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008 - Brasov, Romania Duration: 22 May 2008 → 24 May 2008

Publication series

Name	11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008

Conference

Conference	11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008
Country/Territory	Romania
City	Brasov
Period	22/05/08 → 24/05/08

Access to Document

10.1109/OPTIM.2008.4602501

Cite this

Esmaeildoust, M., & Zakerolhosseini, A. (2008). An efficient algorithm for online placement in a reconfigurable system. In 11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008 (pp. 69-74). Article 4602501 (11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008). https://doi.org/10.1109/OPTIM.2008.4602501

@inproceedings{2db0287e4a734257b9c56f98474b43e9,

title = "An efficient algorithm for online placement in a reconfigurable system",

abstract = "Partially runtime reconfiguration is an efficient method for use in the limited resources in order to increase the performance of the system. In these systems, all the processes use the reconfigurable resources and place their hardware tasks at run time without affecting each other. One of the challenging problems in online task placement is fragmentation of reconfigurable resources. This paper focuses on fragmentation rate of task placement in a reconfigurable system. Several techniques for rectangular tasks are investigated and an algorithm that decreases the fragmentation of a FPGA is presented. The algorithm is able to locate a feasible location with improvement in the fragmentation. The algorithm also produces a lower rejection rate compared to other placement algorithms.",

author = "Mohammad Esmaeildoust and Ali Zakerolhosseini",

year = "2008",

doi = "10.1109/OPTIM.2008.4602501",

language = "English",

isbn = "1424415446",

series = "11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008",

pages = "69--74",

booktitle = "11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008",

note = "11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008 ; Conference date: 22-05-2008 Through 24-05-2008",

}

Esmaeildoust, M & Zakerolhosseini, A 2008, An efficient algorithm for online placement in a reconfigurable system. in 11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008., 4602501, 11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008, pp. 69-74, 11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008, Brasov, Romania, 22/05/08. https://doi.org/10.1109/OPTIM.2008.4602501

An efficient algorithm for online placement in a reconfigurable system. / Esmaeildoust, Mohammad; Zakerolhosseini, Ali.
11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008. 2008. p. 69-74 4602501 (11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - An efficient algorithm for online placement in a reconfigurable system

AU - Esmaeildoust, Mohammad

AU - Zakerolhosseini, Ali

PY - 2008

Y1 - 2008

N2 - Partially runtime reconfiguration is an efficient method for use in the limited resources in order to increase the performance of the system. In these systems, all the processes use the reconfigurable resources and place their hardware tasks at run time without affecting each other. One of the challenging problems in online task placement is fragmentation of reconfigurable resources. This paper focuses on fragmentation rate of task placement in a reconfigurable system. Several techniques for rectangular tasks are investigated and an algorithm that decreases the fragmentation of a FPGA is presented. The algorithm is able to locate a feasible location with improvement in the fragmentation. The algorithm also produces a lower rejection rate compared to other placement algorithms.

AB - Partially runtime reconfiguration is an efficient method for use in the limited resources in order to increase the performance of the system. In these systems, all the processes use the reconfigurable resources and place their hardware tasks at run time without affecting each other. One of the challenging problems in online task placement is fragmentation of reconfigurable resources. This paper focuses on fragmentation rate of task placement in a reconfigurable system. Several techniques for rectangular tasks are investigated and an algorithm that decreases the fragmentation of a FPGA is presented. The algorithm is able to locate a feasible location with improvement in the fragmentation. The algorithm also produces a lower rejection rate compared to other placement algorithms.

UR - http://www.scopus.com/inward/record.url?scp=52949129441&partnerID=8YFLogxK

U2 - 10.1109/OPTIM.2008.4602501

DO - 10.1109/OPTIM.2008.4602501

M3 - Conference contribution

AN - SCOPUS:52949129441

SN - 1424415446

SN - 9781424415441

T3 - 11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008

SP - 69

EP - 74

BT - 11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008

T2 - 11th International Conference on Optimization of Electrical and Electronic Equipment, OPTIM 2008

Y2 - 22 May 2008 through 24 May 2008

ER -

An efficient algorithm for online placement in a reconfigurable system

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this