Person:
TOPCUOĞLU, HALUK RAHMİ

Profile Picture

Email Address

Birth Date

Research Projects

Organizational Units

OrgUnit Logo
Organizational Unit

Job Title

Last Name

TOPCUOĞLU

First Name

HALUK RAHMİ

Name

Filters

2004 - 200912010 - 20111
Reset filters

Settings

Author: BOZ, BETÜL ×

Search Results

Now showing 1 - 2 of 2
  • No Thumbnail Available
    PublicationMetadata only
    A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem
    (Springer Verlag, 2004) BOZ, BETÜL; Demiroz B., Topcuoglu H., Kandemir M.
    One of the strong impacts on runtime performance of a given code is the register allocation phase of compilation. It is crucial to provide aggressive and sophisticated register allocators for the embedded devices, where the excessive compilation time is tolerated because of its off-line nature. In this paper, we present a hybrid evolutionary algorithm for register allocation problem that combines genetic algorithms with a local search technique. Our algorithm exploits a novel, highly-specialized crossover operator that considers domain-specific information. Computational experiments performed on various synthetic benchmarks prove that our method significantly outperform the state-of-the-art algorithms with respect to all given comparison metrics on solution quality. © Springer-Verlag 2004.
  • No Thumbnail Available
    PublicationMetadata only
    Particle simulation on the Cell BE architecture
    (SPRINGER, 2011) BOZ, BETÜL; Demiroz, Betul; Topcuoglu, Haluk R.; Kandemir, Mahmut; Tosun, Oguz
    This paper presents two parallel formulations for the Barnes-Hut algorithm on the Cell architecture, which differ in tree distribution and construction phases of the algorithm. In the initial parallelization, the domains are dynamically partitioned and assigned to the synergistic processing elements (SPEs), and SPEs construct local trees of the sub-domains in parallel. The enhanced parallelization scheme provides better clustering of the particles by sequentially constructing the global tree of the entire work space in the power processing element (PPE) and by partitioning the tree into sub-trees that can fit in the Local Store. SPEs operate on the sub-tree data and construct local trees in parallel. Our experimental evaluation indicates that this application performs much faster on the Cell BE compared to the Intel Xeon based system. Specifically, our first and second methods on the Cell BE outperform Intel Xeon by a factor of 5.8 and 7.1 for 8192 particles, respectively.