Computer Engineering Commons^™

Comparative Analysis Of Fullstack Development Technologies: Frontend, Backend And Database, Qozeem Odeniran

Electronic Theses and Dissertations

Accessing websites with various devices has brought changes in the field of application development. The choice of cross-platform, reusable frameworks is very crucial in this era. This thesis embarks in the evaluation of front-end, back-end, and database technologies to address the status quo. Study-a explores front-end development, focusing on angular.js and react.js. Using these frameworks, comparative web applications were created and evaluated locally. Important insights were obtained through benchmark tests, lighthouse metrics, and architectural evaluations. React.js proves to be a performance leader in spite of the possible influence of a virtual machine, opening the door for additional research. Study b …

Comparative Study Of Snort 3 And Suricata Intrusion Detection Systems, Cole Hoover

Computer Science and Computer Engineering Undergraduate Honors Theses

Network Intrusion Detection Systems (NIDS) are one layer of defense that can be used to protect a network from cyber-attacks. They monitor a network for any malicious activity and send alerts if suspicious traffic is detected. Two of the most common open-source NIDS are Snort and Suricata. Snort was first released in 1999 and became the industry standard. The one major drawback of Snort has been its single-threaded architecture. Because of this, Suricata was released in 2009 and uses a multithreaded architecture. Snort released Snort 3 last year with major improvements from earlier versions, including implementing a new multithreaded architecture …

Faster Multidimensional Data Queries On Infrastructure Monitoring Systems, Yinghua Qin, Gheorghi Guzun

Faculty Research, Scholarly, and Creative Activity

The analytics in online performance monitoring systems have often been limited due to the query performance of large scale multidimensional data. In this paper, we introduce a faster query approach using the bit-sliced index (BSI). Our study covers multidimensional grouping and preference top-k queries with the BSI, algorithms design, time complexity evaluation, and the query time comparison on a real-time production performance monitoring system. Our research work extended the BSI algorithms to cover attributes filtering and multidimensional grouping. We evaluated the query time with the single attribute, multiple attributes, feature filtering, and multidimensional grouping. To compare with the existing prior …

Predicting Pair Success In A Pair Programming Eye Tracking Experiment Using Cross-Recurrence Quantification Analysis, Maureen M. Villamor, Maria Mercedes T. Rodrigo

Department of Information Systems & Computer Science Faculty Publications

Pair programming is a model of collaborative learning. It has become a well-known pedagogical practice in teaching introductory programming courses because of its potential benefits to students. This study aims to investigate pair patterns in the context of pair program tracing and debugging to determine what characterizes collaboration and how these patterns relate to success, where success is measured in terms of performance task scores. This research used eye-tracking methodologies and techniques such as cross-recurrence quantification analysis. The potential indicators for pair success were used to create a model for predicting pair success. Findings suggest that it is possible to …

Event-Driven Servers Using Asynchronous, Non-Blocking Network I/O: Performance Evaluation Of Kqueue And Epoll, Lorcan Leonard

Dissertations

This research project evaluates the performance of kqueue and epoll in the context of event-driven servers. The evaluation is done through benchmarking and tracing which are used to measure throughput and execution time respectively. The experiment is repeated for both a virtualised and native server environment. The results from the experiment are statistically analysed and compared. These results show significant differences between kqueue and epoll, and a profound impact of virtualisation as a variable.

A New Smart Networking Architecture For Container Network Functions, Gülsüm Atici, Pinar Bölük

Turkish Journal of Electrical Engineering and Computer Sciences

5G slices have challenging application demands from a wide variety of fields including high bandwidth, low latency and reliability. The requirements of the container network functions which are used in telecommunications are different from any other cloud native IT applications as they are used for data plane packet processing functions, together with control, signalling and media processing which have critical processing requirements. This study aims to discover high performing container networking solution by considering traffic loads and application types. The behaviour of several container cluster networking solutions -- Flannel, Weave, Libnetwork, Open Virtual Networking for Open vSwitch and Calico -- …

Simulation Of Blade Tip Grooving Effect On Performance Of Twin-Stage Variable-Pitch Axial Fan, Xuemin Ye, Jiankun Zhang, Chunxi Li

Journal of System Simulation

Abstract: For a twin-stage variable-pitch axial fan, a novel blade tip treatment carving a chute from the pressure side to suction side is proposed, and fan performance under different blade tip treatments is simulated to determine the excellent treatment. The effects of blade tip grooving in a single stage or both stages on fan performance and internal dynamics are examined. Numerical results show that both blade tip treatments can improve the fan performance; the overall promotion of fan performance illustrates that the best scheme is the blade tip grooving in the first stage followed by the blade tip grooving …

The Moving Object Reflected Under Matlab Test-Bench (Simulation Model Through Buit-In Functions), Virtyt Lesha, Jozef Bushati, Dea Strica

UBT International Conference

Digital image processing is an area that finds many applications in three-dimensional graphics. One of the subjects considered in image processing is detection of moving objects. In this paper, we have analyzed the performance of an algorithm that detects a moving object. The performance relates to the speed of moving object during a pre-determined time interval. The methodology supports Matlab integrated with built-in functions. Specifically, as input of the simulation model is a video material containing moving objects. The model reads a video file presenting moving objects; after the model is executed in Matlab, the output emits moving objects associated …

A Proposed Approach To Hybrid Software-Hardware Application Design For Enhanced Application Performance, Alex Shipman

Graduate Theses and Dissertations

One important aspect of many commercial computer systems is their performance; therefore, system designers seek to improve the performance next-generation systems with respect to previous generations. This could mean improved computational performance, reduced power consumption leading to better battery life in mobile devices, smaller form factors, or improvements in many areas. In terms of increased system speed and computation performance, processor manufacturers have been able to increase the clock frequency of processors up to a point, but now it is more common to seek performance gains through increased parallelism (such as a processor having more processor cores on a single …

Automated Program Profiling And Analysis For Managing Heterogeneous Memory Systems, Adam Palmer Howard

Masters Theses

Many promising memory technologies, such as non-volatile, storage-class memories and high-bandwidth, on-chip RAMs, are beginning to emerge. Since each of these new technologies present tradeoffs distinct from conventional DRAMs, next-generation systems are likely to include multiple tiers of memory storage, each with their own type of devices. To efficiently utilize the available hardware, such systems will need to alter their data management strategies to consider the performance and capabilities provided by each tier.

This work explores a variety of cross-layer strategies for managing application data in heterogeneous memory systems. We propose different program profiling-based techniques to automatically partition program allocation …

A Location Aware History-Based Approach For Network Selection In Heterogeneous Wireless Networks, Amir Hossein Jafari, Hadi Shahriar Shahhoseini

Turkish Journal of Electrical Engineering and Computer Sciences

Efficient decision making in vertical handoff and network selection algorithms improves users' quality of service and helps users meet service requirements, anywhere and at any time. Hence, in this paper, a user-centric network selection algorithm is proposed, utilizing the estimated reputation of the available candidate networks based on user location and combined experienced users' utility. User utility is defined based on 1) quality of service, 2) monetary cost, and 3) energy consumption metrics. In the proposed history aware-based user location algorithm, the past experience of users for available networks is considered to estimate the future utility that a user can …

Generalized Techniques For Using System Execution Traces To Support Software Performance Analysis, Thelge Manjula Peiris

Open Access Dissertations

This dissertation proposes generalized techniques to support software performance analysis using system execution traces in the absence of software development artifacts such as source code. The proposed techniques do not require modifications to the source code, or to the software binaries, for the purpose of software analysis (non-intrusive). The proposed techniques are also not tightly coupled to the architecture specific details of the system being analyzed. This dissertation extends the current techniques of using system execution traces to evaluate software performance properties, such as response times, service times. The dissertation also proposes a novel technique to auto-construct a dataflow model …

Reliable And Efficient Multithreading, Tongping Liu

Doctoral Dissertations

The advent of multicore architecture has increased the demand for multithreaded programs. It is notoriously far more challenging to write parallel programs correctly and efficiently than sequential ones because of the wide range of concurrency errors and performance problems. In this thesis, I developed a series of runtime systems and tools to combat concurrency errors and performance problems of multithreaded programs. The first system, Dthreads, automatically ensures determinism for unmodified C/C++ applications using the pthreads library without requiring programmer intervention and hardware support. Dthreads greatly simplifies the understanding and debugging of multithreaded programs. Dthreads often matches or even exceeds the …

Star-Crossed Cube: An Alternative To Star Graph, Nibedita Adhikari, Chitta Ranjan Tripathy

Turkish Journal of Electrical Engineering and Computer Sciences

This paper introduces a new interconnection network topology called the star-crossed cube (SCQ). The SCQ is observed to be superior to other contemporary networks in terms of various topological parameters such as diameter, cost, average distance, and message traffic density. The various performance metrics of the proposed network, including cost effectiveness and time-cost effectiveness, are found to be better. The optimal routing and broadcasting algorithms for the new network are also presented. Embedding properties for the proposed network are also studied.

Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu

Research Collection School Of Computing and Information Systems

In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the …