Research Results Categorized

 

 

Main categories:

 

SoC based multi-core systems

 

Microprocessor systems, embedded systems, reconfigurable systems

 

High performance computer network architectures and design

 

Modern computer network architectures, protocols and applications

 

Graph theory and optimization

 

Network modelling, planning, design and optimization

 

Parallel algorithm implementation

 

 

 

 

Subject Area 7:

 

SoC based multi-core systems

 

-        Efficient design and implementation of embedded systems with FPGAs and SoCs

 

-        Use of partial reconfiguration in FPGAs

 

-        DRAM controllers

 

-        Measurement based software timing analysis 

 

-        Low level optimization on SIMD machines

 

Outputs:

 

-        Thesis

 

o   Kocaay, A.B., “Boosting performance of HLS optimization for SoC based hardware accelerators”, MSc Thesis, January 2020.

 

o   Toka, A., “Design and implementation of power quality monitoring system for distribution systems”, MSc Thesis, September 2019.

 

o   Yilmaz, E., “Feasibility study for dynamic context switching in partially reconfigurable FPGAs”, MSc Thesis, September 2019.

 

o   Cilasin, R., “An application-aware dram controller”, MSc Thesis, September 2019.

 

o   Bekdemir, L., “Hybrid probabilistic timing analysis with extreme value theory and copulas”, MSc Thesis, September 2019.

 

o   Uslu, Ç., “Optimizing core signal processing functions on a superscalar SIMD architecture”, MSc Thesis, August 2019.

 

 

 

Subject Area 6:

 

Microprocessor systems, embedded systems, reconfigurable systems

 

-        Efficient design and implementation of embedded systems with FPGAs

 

-        Issues and components towards security of embedded systems

 

-        HW/SW solutions towards cryptografik attacks on embedded systems

 

-        HW/SW solutions towards measuring and reducing packet and system delays

 

Outputs:

 

-        Thesis

 

o   Say, F., “A reconfigurable computing platform for real time embedded applications”, PhD Thesis, Middle East Technical University, September 2011.

 

o   Sert, K., “NFA based regular expression matching on FPGA”, MSc Thesis, September 2018.

 

o   Gözütok, A., “Data plane-based defense system against DDOS attacks for software defined networks”, MSc Thesis, March 2018.

 

o   Efe, O., “Tool support for worst case end to end delay analysis of AFDX networks”, MSc Thesis, February 2016.

 

o   Eylen, T., “One way active delay measurement with error bounds”, MSc Thesis, August 2015.

 

o   Kocalar, G., “GF(2^m) multiplier implementation on a partially reconfigurable FPGA”, MSc Thesis, May 2015.

 

o   Büyükşahin, M.U., “OpenCL implementation of Montgomery multiplication on FPGA”, MSc Thesis, September 2014.

 

o   Tengilimoğlu, B., “Partially reconfigurable FPGA implementation of a real-time system”, MSc Thesis, June 2014.

 

o   Özer, C., “A dynamic memory manager for FPGA applications”, MSc Thesis, June 2014.

 

o   Yıldırım, S., “A true random number generator in FPGA for cryptographic applications”, MSc Thesis, Middle East Technical University, December 2012.

 

o   Uğurel, G., “Benchmarking of Xilkernel, FreeRTOS and µc/OS-II on the soft processor platform MicroBlaze”, MSc Thesis, Middle East Technical University, June 2012.

 

-        Journal

 

o   Eylen, T. and Bazlamaçcı, C.F. “One way active delay measurement with error bounds”, IEEE Trans. on Instrumentation and Measurement, 64/12, 3476-3489 (2015).

 

o   Say, F. and Bazlamaçcı, C.F. “A reconfigurable computing platform for real time embedded applications” Microprocessors and Microsystems, 36/1, 13-32, (2012).

 

-        Conference

 

o   Yıldırım, S. and Bazlamaçcı, C.F. “A true random number generator and test platform built in FPGA”, Proc. of the 5th Int. Conf. on Information Security and Cryptology (ISCTurkey 2012), Ankara (Turkey), 262-267 (2012).

 

o   Uğurel, G. and Bazlamaçcı, C.F. “Context switching time and memory footprint comparison of Xilkernel and µC/OS-II on MicroBlaze”, Proc. of the 7th Int. Conf. on  Electrical and Electronics Engineering (ELECO 2011), Bursa (Turkey), v.2, 52-55 (2011).

 

o   Tengilimoğlu, B. and C.F. Bazlamaçcı, “Partial reconfiguration on a real-time target detection and tracking system”, Proc. of the 22nd Signal Processing and Communications Applications Conf. (SIU 2014), Trabzon (Turkey), Karadeniz Technical University, 23-25 April 2014.

 

o   Uğurel, G. and C.F. Bazlamaçcı, "Comparison of real time operating systems on MicroBlaze" Automation (Otomasyon), Vol. 236, 316-322, Bileşim Yayıncılık, (2012). (in Turkish)

 

 

 

Subject Area 5:

 

High performance computer network architectures and design

 

-        High performance implementation of network protocols

 

-        High performance and cost effective design of core router functionalities using special data structures

 

o   Fast packet processing

 

o   Fast packet classification

 

o   Implementationof on FPGS

 

-        Network-on-chip (NoC)

 

Outputs:

 

-        Thesis Work

 

o   Çelik, C., “Energy and buffer aware application mapping for network on chips”, PhD Thesis, Middle East Technical University, February 2013.

 

o   Erdem, O., “Parallel and pipelining architectures for high speed packet forwarding”, PhD Thesis, Middle East Technical University, September 2011 (recipient of the “Thesis of the Year Award 2010-2011” by METU Graduate School of Natural and Applied Sciences).

 

o   Özcan, D., “Parallel rectilinear Steiner tree solution using GPGPU”, MSc Thesis, December 2015.

 

o   Baysal, D., “Trie-tree data structure for IP lookup in virtual routers”, MSc Thesis, Middle East Technical University, January 2014.

 

o   Rumelili, Ç.I., “Memory organization in pipelined hierarchical search structures for packet classification”, MSc Thesis, Middle East Technical University, June 2013.

 

o   Özkaner, A., “Prototype development and verification of an IP lookup engine on FPGA”, MSc Thesis, Middle East Technical University, February 2012.

 

o   Kılınç, İ.Ö., “FPGA implementation of a network-on-chip”, MSc Thesis, Middle East Technical University, September 2011.

 

-        Patent

 

o   Bazlamaçcı, C.F. and Erdem, O. “Systolic array architecture for fast IP lookup” (triadic patent achieved under METU Technopolis portfolio)

o   European Patent No: EP2517420B1, Date of patent: March 19, 2014

o   USA Patent No: US 8,724624 B, Date of patent: May 13, 2014

o   Japanese Patent No: 5529976, Date of patent: April 25, 2014

 

o   Bazlamaçcı, C.F. and Erdem, O. “Hızlı IP arama için sistolik dizilim mimarisi”

o   TPE Patent No: TR 2012 09797 B, Date of patent: March 19, 2014

 

-        Journal

 

o   Çelik, C. and Bazlamaçcı, C.F. “Evaluation of energy and buffer aware application mapping for networks-on-chip”, Microprocessors and Microsystems, 38/4, 325-336, (2014).

 

o   Çelik, C. and Bazlamaçcı, C.F. “Energy and buffer aware application mapping for network-on-chips with self similar traffic”, Journal of Systems Architecture, 59/10, 1364–1374, (2013).  

 

o   Erdem, O. and Bazlamaçcı, C.F. “High performance IP lookup engine with compact clustered trie search”, Computer Journal, 55/12, 1447-1466, (2012).

 

o   Erdem, O. and Bazlamaçcı, C.F. “Array design for trie-based IP lookup” IEEE Communications Letters, 14/8, 773-775, (2010).

 

-        Conference

 

o   Erdem, O., Hoang, L., Prasanna, V.K. and Bazlamaçcı, C.F. “Hybrid data structure for IP lookup in virtual routers using FPGAs”, Proc. of the 22nd IEEE Int. Conf. on  Application-specific Systems, Architectures and Processors (ASAP 2011), ed. J.R. Cavallaro, et. al., Santa Monica, California (USA) 95-101, IEEE (2011).

 

o   Erdem, O. and Bazlamaçcı, C.F. “MIPS extension for a TCAM based parallel architecture for fast IP lookup”, Proc. of the 24th Int. Symp. on Computer and Information Sciences (ISCIS 2009), ed. F.Y. Vural, et. al., Güzelyurt (Northern Cyprus Turkish Republic), 310-315, IEEE (2009).

 

o   Erdem, O., Hoang, L., Prasanna, V.K. and Bazlamaçcı, C.F. “Hybrid data structure for IP lookup in virtual routers using FPGAs”, 19th IEEE Int. Symp. On Field-Programmable Custom Computing Machines (FCCM 2011) (poster session), Salt Lake City, Utah (USA), Abstract Volume p.253 (2011).

 

o   Erdem, O. and C.F. Bazlamaçcı, “SRAM based systolic array architecture for fast IP lookup and matching”, Proc. of the 13th. Nat. Symp. on Electrical, Electronics, Computer and Biomedical Engineering, Ankara (Turkey), 173-178, EMO (2009). (in Turkish)

 

 

 

Subject Area 4:

 

Modern computer network architectures, protocols and applications

 

-        Cloud architecture

 

-        Software defined networks (SDN)

 

-        Virtual routers

 

-        Wireless sensor networks (WSN)

 

-        Router protocols

 

-        Router implementations

 

Outputs:

 

-        Thesis

 

o   Dikbayır, H.S., “A hybrid resource allocation system for cloud computing”, MSc Thesis, September 2014.

 

o   Soltani, A., “Flow initiation in software defined networking”, MSc Thesis, Middle East Technical University, February 2014.

 

o   Jarchlo, E.A., “Life-time sensitive weighted clustering algorithm on wireless sensor networks”, MSc Thesis, Middle East Technical University, September 2013.

 

o   Akbaş, M.İ., “Evaluation of core stateless guaranteed fair network architecture”, MSc Thesis, Middle East Technical University, September 2006.

 

o   Bereketli, A., “On QoS multicast routing protocols”, MSc Thesis, Middle East Technical University, September 2005.

 

o   Çelik, C. “Performance analysis of reliable multicast”, MSc Thesis, Middle East Technical University, December 2004.

 

o   Özbilgin, G., “Reroute sequence planning in multiprotocol label switching networks”, MSc Thesis, Middle East Technical University, December 2004.

 

o   Öğünlü, B., “Lifetime analysis for wireless sensor networks”, MSc Thesis, Middle East Technical University, August 2004.

 

o   Önal, K., “Internet multicast congestion control”, MSc Thesis, Middle East Technical University, February 2004.

 

o   Kaçar, M.N., “A soho router implementation on Motorola MCF5272 processor and UCLinux operating system”, MSc Thesis, Middle East Technical University, August 2003.

 

o   Öztürk, E., “Fairness in differentiated services architecture”, MSc Thesis, Middle East Technical University, December 2001.

 

-        Conference 

 

o   Soltani, A. and Bazlamaçcı, C.F., “HyFI: Hybrid flow initiation in software defined networks”, Proc. of the 5th Int. Conf. on Information and Communication Systems (ICICS2014), Irbid (Jordan) 1-3 April 2014.

 

o   Alizadeh, E.J. and Bazlamaçcı, C.F. “Life time sensitive weighted clustering on wireless sensor networks”, Proc. of the 3rd Int. Conf. on Sensor Networks (SENSORNETS 2014), Lisbon (Portugal), 41-51 (2014).

 

o   Çelik, C. and Bazlamaçcı, C.F. “Effect of application mapping on network-on-chip performance”, Proc. of the 20th Euromicro Int. Conf. on Parallel, Distributed and Network-Based Computing (PDP 2012), Munich (Germany), 465-472 (2012).

 

o   Çelik, C. and Bazlamaçcı, C.F. “Performance analysis of reliable multicast protocols”, Proc. of the 20th Int. Symp. on Computer and Information Sciences (ISCIS 2005), İstanbul (Turkey), Advances in Computer Science and Engineering: Reports – Vol. 1: New Trends in Computer Networks, ed. T.Tugcu, et. al., 319-328, Imperial College Press, London, UK (2005).

 

o   Öztürk, E.A. and Bazlamaçcı, C.F. “Fairness in differentiated services architecture”, Proc. 17th Int. Symp. on Computer and Information Sciences (ISCIS XVII), ed. I. Çiçekli, et. al., Florida (USA), 264-268, CRC Press (2003).

 

 

 

Subject Area 3:

 

Graph theory and optimization

 

-        Graph algorithms

 

-        Optimization theory and mathematical programming

 

-        Advanced data structures and algorithms

 

Outputs:

 

-        Thesis

 

o   Cinel, S., “Sequential and parallel heuristic algorithms for the rectilinear Steiner tree problem”, MSc Thesis, Middle East Technical University, September 2006.

 

o   Say, F., “Minimum concave cost multi-commodity network design problem”, MSc Thesis, Middle East Technical University, September 2005.

 

o   Bayramoğlu, N.Y., “Recursive shortest spanning tree algorithms for image segmentation”, MSc Thesis, Middle East Technical University, July 2005.

 

o   Yeler, T., “University course scheduling using a genetic algorithm”, MSc Thesis, Middle East Technical University, December 2002.

 

o   Yılmaz, H., “Traveling salesman problem: Solution with branch and bound and data correction algorithms”, MSc Thesis, Middle East Technical University, December 2001.

 

o   Karadeniz, B., “Lower bounds for the minimum span frequency assignment problem in cellular networks”, MSc Thesis, Middle East Technical University, December 2001.

 

o   Ertem (Önem), D., “Minimum weight directed spanning tree problem with degree, hop and capacity constraint”, MSc Thesis, Middle East Technical University, April 2001.

 

-        Journal 

 

o   Cinel, S. and Bazlamaçcı, C.F. “A distributed heuristic algorithm for the rectilinear Steiner minimal tree problem”, IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 27/11, 2083-2087 (2008).

 

o   Bazlamaçcı, C.F. and Say, F. “Minimum concave cost multicommodity network design”, Telecommunication Systems, 36/4, 181-203 (2007).

 

-        Conference 

 

o   Bayramoğlu, N.Y. and Bazlamaçcı, C.F. “Recursive shortest spanning tree algorithms for image segmentation”, Proc. of the IEEE International Conference on "Computer as a Tool" (EUROCON 2005), Belgrade (Serbia and Montenegro), 979-982, IEEE Press (2005).

 

o   Önem (Ertem), D. and Bazlamaçcı, C.F. “Minimum weight directed spanning tree   problem with degree, hop and capacity constraints”, Proc. 16th Int. Symp. on Computer and Information Sciences (ISCIS XVI), ed. S. Kuru, et. al., Antalya (Turkey), 429-436, Işık University (2001).

 

o   Bazlamaçcı, C.F. and B. Karadeniz, “Lower bounds for the minimum span frequency assignment problem in cellular networks”, Proc. of the Electrical Electronics and Computer Engineering Symposium (ELECO'02), Bursa (Turkey), Electronics Volume: 252-256 TMMOB, Uludağ University, Istanbul Technical University, Tübitak (2002). (in Turkish)

 

 

 

Subject Area 2:

 

Network modelling, planning, design and optimization

 

-        synthesis and design of communication and computer networks using graph theoretical techniques, optimization methods and advanced data structures

 

-        Selected sub-topics

 

o   ‘minimum cost multicommodty flow networks’

 

§  minimum concave-cost multi-commodity network design

 

§  minimum concave-cost uncapacitated transshipment

 

o    ‘centralized tree-like networks’

 

§  minimum weight spanning tree

 

§  minimum weight spanning tree verification

 

§  capacitated minimal spanning tree

 

Outputs:

 

-        Thesis

 

o   Bazlamaçcı, C.F., “Optimized network design: minimum spanning trees and minimum concave-cost problems, PhD Thesis, University of Manchester Institute of Science and Technology (UMIST), December 1996.

 

-        Journal 

 

o   Bazlamaçcı, C.F. and Hindi, K.S. “Minimum-weight spanning tree algorithms: A survey and empirical study”, Computers & Operations Research, 28/8, 767-785 (2001).

 

o   Bazlamaçcı, C.F. and Hindi, K.S. “Enhanced adjacent extreme point search and Tabu search for the minimum, concave-cost uncapacitated transshipment problem”, Journal of the Operational Research Society, 47/9, 1150-1165 (1996).

 

-        Conference 

 

o   Bazlamaçcı, C.F. and Hindi, K.S. “An empirical study of minimum-weight spanning tree algorithms, classical and modern,” Proc. of the 14th Int. Symp. on Computer and Information Sciences (ISCIS XIV), ed. M. Türksever, et. al., Kuşadası (Turkey), 370-380, Ege University (1999).

 

o   Bazlamaçcı, C.F. and Hindi, K.S. “Verifying minimum spanning trees in linear time,” Proc. of the Symp. on Operations Research (SOR 1996), ed. U. Zimmerman et. al., Braunschweig (Germany), 139-144, Springer-Verlag, Heidelberg (1997).

 

o   Bazlamaçcı, C.F. and Hindi, K.S. “A tabu search algorithm for concave cost transshipment problems,” Proc. of the 3rd IFIP WG-7.6 Working Conference on Optimization-based Computer-aided Modeling and Design (IFIP 1994), ed. J. Dolezal and J. Fidler, Prague (Czech Rep.) 94-101, Academy of Sciences of the Czech Rep. (1994).

 

o   Bazlamaçcı, C.F. and Hindi, K.S. “Disaggregate local search for minimum concave-cost multi-commodity network design,” Proc. of the Symp. on Operations Research (SOR 1997), Jena (Germany), Abstract Volume p.46 (1997).

 

o   Bazlamaçcı, C.F. and Hindi, K.S. “A branch and bound algorithm for the capacitated minimal spanning tree problem using a directed formulation,” Proc. of the 16th Int. Symp. on Mathematical Programming (ISMP 1997), Lausanne (Switzerland), Abstract Volume p.43 (1997).

 

o   Bazlamaçcı, C.F. and K.S. Hindi, “A branch and bound algorithm for the capacitated minimal spanning tree problem using a directed-flow formulation,” Proc. of the 2nd Symp. on Computer Networks (BAS'97), ed. S. Bilgen and A. Özgit, Ankara (Turkey), 31-40, Middle East Technical University (1997).

 

 

 

Subject Area 1:

 

Parallel algorithm implementation

 

-        FFT implementation and performance evaluation on a multi-core computer system using transputers and its programming language Occam.

 

Outputs:

 

-        Thesis

 

o   Bazlamaçcı, C.F., “A fast Fourier transform implementation and performance evaluation on a transputer based parallel computer system”, MSc Thesis, Middle East Technical University, July 1991.

 

-        Conference

 

o   Güran, H., and Bazlamaçcı, C.F. “Performance of parallel FFT on a transputer based mesh architecture,” Proc. of the 7th Int. Symp. on Computer and Information Sciences (ISCIS VII), ed. E. Gelenbe, et. al., Antalya (Turkey), 503-506, Universite Rene Descartes (1992)

 

o   Ünal, E., Bazlamaçcı, C.F., and Güran, H., “Investigation of transputer performance using transform coding of images and FFT methods”, Proc. of the Electrical Electronics and Computer Engineering Conference (BİLKON’91), Ankara (Turkey), 270-274, Bilkent University (1991). (in Turkish).