Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 9 of 9

Full-Text Articles in Engineering

Improving Large Scale Application Performance Via Data Movement Reduction, Dewan M. Ibtesham Nov 2017

Improving Large Scale Application Performance Via Data Movement Reduction, Dewan M. Ibtesham

Computer Science ETDs

The compute capacity growth in high performance computing (HPC) systems is outperforming improvements in other areas of the system for example, memory capacity, network bandwidth and I/O bandwidth. Therefore, the cost of executing a floating point operation is decreasing at a faster rate than moving that data. This increasing performance gap causes wasted CPU cycles while waiting for slower I/O operations to complete in the memory hierarchy, network, and storage. These bottlenecks decrease application time to solution performance, and increase energy consumption, resulting in system under utilization. In other words, data movement is becoming a key concern for future HPC …


Improving Hpc Communication Library Performance On Modern Architectures, Matthew G. F. Dosanjh Oct 2017

Improving Hpc Communication Library Performance On Modern Architectures, Matthew G. F. Dosanjh

Computer Science ETDs

As high-performance computing (HPC) systems advance towards exascale (10^18 operations per second), they must leverage increasing levels of parallelism to achieve their performance goals. In addition to increased parallelism, machines of that scale will have strict power limitations placed on them. One direction currently being explored to alleviate those issues are many-core processors such as Intel’s Xeon Phi line. Many-core processors sacrifice clock speed and core complexity, such as out of order pipelining, to increase the number of cores on a die. While this increases floating point throughput, it can reduce the performance of serialized, synchronized, and latency sensitive code …


Prediction Of Graduation Delay Based On Student Characterisitics And Performance, Tushar Ojha Jul 2017

Prediction Of Graduation Delay Based On Student Characterisitics And Performance, Tushar Ojha

Electrical and Computer Engineering ETDs

A college student's success depends on many factors including pre-university characteristics and university student support services. Student graduation rates are often used as an objective metric to measure institutional effectiveness. This work studies the impact of such factors on graduation rates, with a particular focus on delay in graduation. In this work, we used feature selection methods to identify a subset of the pre-institutional features with the highest discriminative power. In particular, Forward Selection with Linear Regression, Backward Elimination with Linear Regression, and Lasso Regression were applied. The feature sets were selected in a multivariate fashion. High school GPA, ACT …


Distributed Knowledge Discovery For Diverse Data, Hossein Hamooni Jul 2017

Distributed Knowledge Discovery For Diverse Data, Hossein Hamooni

Computer Science ETDs

In the era of new technologies, computer scientists deal with massive data of size hundreds of terabytes. Smart cities, social networks, health care systems, large sensor networks, etc. are constantly generating new data. It is non-trivial to extract knowledge from big datasets because traditional data mining algorithms run impractically on such big datasets. However, distributed systems have come to aid this problem while introducing new challenges in designing scalable algorithms. The transition from traditional algorithms to the ones that can be run on a distributed platform should be done carefully. Researchers should design the modern distributed algorithms based on the …


Packet Scheduling Algorithms In Lte/Lte-A Cellular Networks: Multi-Agent Q-Learning Approach, Najem Nafiz Sirhan Jul 2017

Packet Scheduling Algorithms In Lte/Lte-A Cellular Networks: Multi-Agent Q-Learning Approach, Najem Nafiz Sirhan

Electrical and Computer Engineering ETDs

Spectrum utilization is vital for mobile operators. It ensures an efficient use of spectrum bands, especially when obtaining their license is highly expensive. Long Term Evolution (LTE), and LTE-Advanced (LTE-A) spectrum bands license were auctioned by the Federal Communication Commission (FCC) to mobile operators with hundreds of millions of dollars. In the first part of this dissertation, we study, analyze, and compare the QoS performance of QoS-aware/Channel-aware packet scheduling algorithms while using CA over LTE, and LTE-A heterogeneous cellular networks. This included a detailed study of the LTE/LTE-A cellular network and its features, and the modification of an open source …


Detection Of Pheromone Laying Event In Foraging Data Of Harvester Ants Using Change Point Analysis Method, Safeeul Bashir Safee Apr 2017

Detection Of Pheromone Laying Event In Foraging Data Of Harvester Ants Using Change Point Analysis Method, Safeeul Bashir Safee

Computer Science ETDs

Communication is an important factor in the foraging performance of social insects, such as ants. During foraging, ants keep track of food sources by using memory (site fidelity) or by communicating through pheromones. Previous field experiments showed that the rate of seed collection depends on the distribution of food in the environment. If food is spatially clustered, then it is beneficial for ants recruit nest mates to collect seeds from large clusters. However, we do not know when the recruitment occurs in natural ant population. To explore this question, we used a power law distribution to arrange seeds in piles …


Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea Jan 2017

Computation Of Shortest Path Problem In A Network With Sv-Triangular Neutrosophic Numbers, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

In this article, we present an algorithm method for finding the shortest path length between a paired nodes on a network where the edge weights are characterized by single valued triangular neutrosophic numbers. The proposed algorithm gives the shortest shortest path length from source node to destination node based on a ranking method. Finally, a numerical example is also presented to illustrate the efficiency of the proposed approach.


An Operational View In Computational Construction Of Information, Florentin Smarandache, Stefan Vladutescu, Constantin Dima, Valeriu Voinea Jan 2017

An Operational View In Computational Construction Of Information, Florentin Smarandache, Stefan Vladutescu, Constantin Dima, Valeriu Voinea

Branch Mathematics and Statistics Faculty and Staff Publications

The paper aims to explain the technology of emergence of information. Our research proves that information as communicational product is the result of processing within some operations, actions, mechanisms and strategies of informational material meanings. Are determined eight computational-communicative operations of building information. Information occurs in two communication phases, syncretic and the segregation-synthetic. The syncretic phase consists of four operations: referral of significant field, primary delimitation of information, detection-looking information and an anticipative-draft constitution (feedforward). The segregation-synthetic phase also includes four operations: discrimination, identification, interpretation and confrontation (feedback). In the future we will investigate informational actions, mechanisms and strategies.


A Lattice Theoretic Look: A Negated Approach To Adjectival (Intersective, Neutrosophic And Private) Phrases, Florentin Smarandache, Selcuk Topal Jan 2017

A Lattice Theoretic Look: A Negated Approach To Adjectival (Intersective, Neutrosophic And Private) Phrases, Florentin Smarandache, Selcuk Topal

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.