Bazlamaçcı, Cüneyt

Loading...
Name Variants
Bazlamaçcı, Cüneyt Fehmi
Bazlamacci, Cuneyt
F. Bazlamaçcı, Cüneyt
F. Bazlamaçci, Cüneyt
F. Bazlamacci, Cuneyt
Bazlamaçcı, Cüneyt F.
Bazlamaçci, Cüneyt Fehmi
Bazlamacci, Cuneyt Fehmi
Bazlamacci, Cuneyt F.
Job Title
Email Address
cuneytbazlamacci@iyte.edu.tr
Main Affiliation
03.04. Department of Computer Engineering
Status
Current Staff
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

NO POVERTY1
NO POVERTY
0
Research Products
ZERO HUNGER2
ZERO HUNGER
0
Research Products
GOOD HEALTH AND WELL-BEING3
GOOD HEALTH AND WELL-BEING
0
Research Products
QUALITY EDUCATION4
QUALITY EDUCATION
0
Research Products
GENDER EQUALITY5
GENDER EQUALITY
0
Research Products
CLEAN WATER AND SANITATION6
CLEAN WATER AND SANITATION
0
Research Products
AFFORDABLE AND CLEAN ENERGY7
AFFORDABLE AND CLEAN ENERGY
0
Research Products
DECENT WORK AND ECONOMIC GROWTH8
DECENT WORK AND ECONOMIC GROWTH
0
Research Products
INDUSTRY, INNOVATION AND INFRASTRUCTURE9
INDUSTRY, INNOVATION AND INFRASTRUCTURE
1
Research Products
REDUCED INEQUALITIES10
REDUCED INEQUALITIES
0
Research Products
SUSTAINABLE CITIES AND COMMUNITIES11
SUSTAINABLE CITIES AND COMMUNITIES
0
Research Products
RESPONSIBLE CONSUMPTION AND PRODUCTION12
RESPONSIBLE CONSUMPTION AND PRODUCTION
0
Research Products
CLIMATE ACTION13
CLIMATE ACTION
0
Research Products
LIFE BELOW WATER14
LIFE BELOW WATER
0
Research Products
LIFE ON LAND15
LIFE ON LAND
0
Research Products
PEACE, JUSTICE AND STRONG INSTITUTIONS16
PEACE, JUSTICE AND STRONG INSTITUTIONS
0
Research Products
PARTNERSHIPS FOR THE GOALS17
PARTNERSHIPS FOR THE GOALS
0
Research Products
Documents

22

Citations

200

h-index

7

This researcher does not have a WoS ID.
Scholarly Output

4

Articles

1

Views / Downloads

3164/1159

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

1

Scopus Citation Count

10

Patents

0

Projects

0

WoS Citations per Publication

0.25

Scopus Citations per Publication

2.50

Open Access Source

4

Supervised Theses

0

JournalCount
2021 Turkish National Software Engineering Symposium, UYMS 2021 - Proceedings1
Microprocessors and Microsystems1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Scholarly Output Search Results

Now showing 1 - 4 of 4
  • Conference Object
    Citation - Scopus: 2
    Workload Distribution on Heterogeneous Platforms
    (IEEE, 2021) Alasmar, Mahmoud; Bazlamaçcı, Cüneyt
    This paper targets the problem of finding an efficient distribution of a computational task on a heterogeneous computing platform. The heterogeneity of the processing elements arise due to differences in computation speed and memory capacity of the processors. We first consider using a discrete functional performance model that integrates processing speed and capacity of processing elements and then develop a mathematical model and propose a heuristic mapping algorithm for distributing a given total workload of size N on p processing elements such that the total computation time is minimized. Computational results show that the proposed method provides a significant improvement in reducing the computation time in comparison to equal distribution approach.
  • Article
    Citation - WoS: 1
    Citation - Scopus: 1
    Hybrid Probabilistic Timing Analysis With Extreme Value Theory and Copulas
    (Elsevier, 2022) Bekdemir, Levent; Bazlamaçcı, Cüneyt F.
    The primary challenge of time-critical systems is to guarantee that a task completes its execution before its deadline. In order to ensure compliance with timing requirements, it is necessary to analyze the timing behavior of the overall software. Worst-Case Execution Time (WCET) represents the maximum amount of time an individual software unit takes to execute and is used for scheduling analysis in safety-critical systems. Recent studies focus on statistical approaches, which augments measurement-based timing analysis with probabilistic confidence level by applying stochastic methods. Common approaches either utilize Extreme Value Theory (EVT) for end-to-end measurements or convolution techniques for a group of program units to derive probabilistic upper bounds for the program. The former method does not ensure path coverage while the latter suffers from ignoring possible extreme cases. Furthermore, current state-of-the-art convolution methods employed in a commercial WCET analysis tool overestimates the results because of using the assumption of worst-case dependence between basic blocks. In this paper, we propose a hybrid probabilistic timing analysis framework and modeling the program units with EVT to capture extreme cases and use Copulas to model the dependency between the units to derive tighter distributional bounds in order to mitigate the effects of co-monotonic assumptions.
  • Conference Object
    Citation - Scopus: 2
    Hibrit Olasılıksal Zamanlama Analizi
    (IEEE, 2021) Bekdemir, Levent; Bazlamaçcı, Cüneyt F.
    Zaman-kritik sistemlerde mevcut güçlüklerin başında bir işin gereken son bitirilme zamanından önce tamamlanacak olmasının garanti edilmesi hususu gelir. Bu amaçla yazılımın tümünün davranışının çözümlenmesi gerekir. En kötü yürütme süresi bir yazılım biriminin olası en yüksek yürütme zamanını temsil eder ve bu metrik zaman-kritik sistemlerin kaynak planlamasında kullanılır. İlgili alandaki yakın zamanlı çalışmalar daha çok istatistiksel yaklaşımlara yer vermiştir. Bunlar, ölçüme dayalı zamanlama analizlerini stokastik yöntemler yardımıyla elde edilen olasılıksal güvenirlik seviyeleriyle tamamlamaktadırlar. En çok kullanılan yöntemlerde, ya uçtan uca ölümleri uç değer teorisi yardımıyla kullanarak ya da küçük program parçacıklarının ölçümlerini evrişim (convolution) teknikleri kullanarak tüm programın üst sınırı belirlenmeye çalışılmaktadır. Her iki yaklaşım da sorunludur. Bu çalışmada bir hibrid olasılıksal zamanlama analiz metodu önerilmektedir. Bu metod ile program yapı taşı olan alt birimler ayrı ayrı ve uç değer teorisi yardımıyla modellenerek en üst değerler yakalanabilmekte, kopulalar kullanarak da birimler arası bağımlılıklar modellenmekte ve sonuçta daha iyi bir sınır değer dağılımı bulunabilmektedir.
  • Conference Object
    Citation - Scopus: 5
    Nfa Based Regular Expression Matching on Fpga
    (IEEE, 2021) Sert, Kamil; Bazlamaçcı, Cüneyt
    String matching is about finding all occurrences of a string within a given text. String matching algorithms have important roles in various real world areas such as web and security applications. In this work, we are interested in solving regular expression matching hence a more general form of string matching problem targeting especially the field of network intrusion detection systems (NIDS). In our work, we enhance a non-deterministic finite automata (NFA) based method on FPGA considerably. We propose to use a matching structure that processes two consecutive characters instead of one in order to yield better memory utilization and provide a novel mapping of this new architecture onto FPGA. The amount of digital circuitry needed to represent the NFA is reduced due to having less number of states and less number of LUTs in the devised 2-character regex matching process. An evaluation study is performed using the well-known Snort rule set and a sizable performance improvement is demonstrated.