Parallel Scalable PDE Constrained Optimization Antenna Identification in Hyperthermia Cancer Treatment Planning

Date

2009-01-01

Author

SCHENK, Olaf
Manguoğlu, Murat
CHRİSTEN, Matthias
SATHE, Madan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

197
views

0
downloads

We present a PDE-constrained optimization algorithm which is designed for parallel scalability on distributed-memory architectures with thousands of cores. The method is based on a line-search interior-point algorithm for large-scale continuous optimization, it is matrix-free in that it does not require the factorization of derivative matrices. Instead, it uses a new parallel and robust iterative linear solver on distributed-memory architectures. We will show almost linear parallel scalability results for the complete optimization problem, which is a new emerging important biomedical application and is related to antenna identification in hyperthermia cancer treatment planning.

Subject Keywords

General Computer Science

URI

https://hdl.handle.net/11511/35309

Journal

Computer Science Research and Development

DOI

https://doi.org/10.1007/s00450-009-0080-x

Collections

Department of Computer Engineering, Article

Suggestions

OpenMETU
Core

Pipelined design approach to microprocessor architectures a partial implementation : mips pıpelined architecture on fpga Altıniğneli, Muzaffer Can; Güran, Hasan; Department of Electrical and Electronics Engineering (2005) This thesis demonstrate how pipelining in a RISC processor is achieved by implementing a subset of MIPS R2000 instructions on FPGA. Pipelining, which is one of the primary concepts to speed up a microprocessor is emphasized throughout this thesis. Pipelining is fundamentally invisible for high level programming language user and this work reveals the internals of microprocessor pipelining and the potential problems encountered while implementing pipelining. The comparative and quantitative flow of this thes...
A Depth-optimal Low-complexity Distributed Wireless Multicast Algorithm Akyurek, A. Sinan; Uysal, Elif (Oxford University Press (OUP), 2011-06-01) This paper presents a wireless multicast tree construction algorithm, SWIM (Source-initiated WIreless Multicast). SWIM constructs a tree on which each multicast destination has the minimum possible depth (number of hops from the nearest source). It is proved that SWIM is fully distributed, with a worst case complexity upper-bounded by O(N-3), and an empirically found average complexity of only O(N-2). SWIM forms one shared tree from source(s) to the multicast destinations; yet, as a by-product, it creates a...
Optimum design of grillage systems using harmony search algorithm Erdal, Ferhat; Saka, Mehmet Polat; Department of Engineering Sciences (2007) Harmony search method based optimum design algorithm is presented for the grillage systems. This numerical optimization technique imitates the musical performance process that takes place when a musician searches for a better state of harmony. For instance, jazz improvisation seeks to find musically pleasing harmony similar to the optimum design process which seeks to find the optimum solution. The design algorithm considers the displacement and strength constraints which are implemented from LRFD-AISC (Loa...
Implementation of an 8-bit microcontroller with system c Kesen, Lokman; Aşkar, Murat; Department of Electrical and Electronics Engineering (2004) In this thesis, an 8-bit microcontroller, 8051 core, is implemented using SystemC programming language. SystemC is a new generation co-design language which is capable of both programming software and describing hardware parts of a complete system. The benefit of this design environment appears while developing a System-on-Chip (SoC), that is a system consisting both custom hardware parts and embedded software parts. SystemC is not a completely new language, but based on C++ with some additional class libra...
Data sharing and access with a corba data distribution service implementation Dursun, Mustafa; Bilgen, Semih; Department of Electrical and Electronics Engineering (2006) Data Distribution Service (DDS) specification defines an API for Data-Centric Publish-Subscribe (DCPS) model to achieve efficient data distribution in distributed computing environments. Lack of definition of interoperability architecture in DDS specification obstructs data distribution between different and heterogeneous DDS implementations. In this thesis, DDS is implemented as a CORBA service to achieve interoperability and a QoS policy is proposed for faster data distribution with CORBA features.

Citation Formats

O. SCHENK, M. Manguoğlu, M. CHRİSTEN, and M. SATHE, “Parallel Scalable PDE Constrained Optimization Antenna Identification in Hyperthermia Cancer Treatment Planning,” Computer Science Research and Development, pp. 0–0, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35309.