Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- University of Arkansas, Fayetteville (4)
- California State University, San Bernardino (3)
- Loyola University Chicago (3)
- Old Dominion University (3)
- Selected Works (3)
-
- University of Nebraska - Lincoln (3)
- Western University (3)
- Florida International University (2)
- SelectedWorks (2)
- University of Nevada, Las Vegas (2)
- University of New Mexico (2)
- Air Force Institute of Technology (1)
- Brigham Young University (1)
- California Polytechnic State University, San Luis Obispo (1)
- Georgia Southern University (1)
- Portland State University (1)
- Purdue University (1)
- Singapore Management University (1)
- University of Dayton (1)
- University of Louisville (1)
- University of Massachusetts Amherst (1)
- University of New Orleans (1)
- University of South Alabama (1)
- University of Tennessee, Knoxville (1)
- Washington University in St. Louis (1)
- Western Michigan University (1)
- Keyword
-
- Interconnection network (3)
- Latency (3)
- Queueing theory (3)
- Throughput (3)
- Wormhole routing (3)
-
- Area-universal networks (2)
- Area-universality (2)
- Butterfly fat-tree (2)
- Cloud Computing (2)
- Fault Tolerance (2)
- MDS array codes (2)
- Machine Learning (2)
- Message routing algorithms (2)
- Parallel computation (2)
- RAID-6 (2)
- Reliability (2)
- Storage system (2)
- 2D-mesh (1)
- 3-tier (1)
- ADMM (1)
- Agent-based Modeling (ABM) (1)
- Algebraic multigrid (1)
- Algorithmic fairness (1)
- Algorithms--Data processing (1)
- Analog computation (1)
- Analytical models (1)
- Anomaly (1)
- Arithmetic – Computer programs (1)
- Articles (1)
- Artificial Intelligence & Robotic Control (1)
- Publication Year
- Publication
-
- Computer Science: Faculty Publications and Other Works (3)
- Electronic Thesis and Dissertation Repository (3)
- Journal of International Technology and Information Management (3)
- CSE Technical Reports (2)
- Electronic Theses and Dissertations (2)
-
- FIU Electronic Theses and Dissertations (2)
- Graduate Theses and Dissertations (2)
- Ronald Greenberg (2)
- College of Engineering: Graduate Celebration Programs (1)
- Computer Science ETDs (1)
- Computer Science Faculty Publications (1)
- Computer Science Faculty Publications and Presentations (1)
- Computer Science Theses & Dissertations (1)
- Computer Science and Computer Engineering Undergraduate Honors Theses (1)
- Content presented at the MAICS conference (1)
- Doctoral Dissertations (1)
- Electrical & Computer Engineering Faculty Research (1)
- Engineering Management & Systems Engineering Faculty Publications (1)
- Faculty Publications (1)
- Faculty Publications and Other Works -- EECS (1)
- Jeremy Straub (1)
- Journal of Nonprofit Innovation (1)
- Jozsef A Toth Ph.D. (1)
- Library Philosophy and Practice (e-journal) (1)
- Mark L. Chang (1)
- Master's Theses (1)
- Mathematical Sciences Spring Lecture Series (1)
- Mathematics & Statistics ETDs (1)
- McKelvey School of Engineering Theses & Dissertations (1)
- Parallel Computing and Data Science Lab Technical Reports (1)
- Publication Type
- File Type
Articles 1 - 30 of 45
Full-Text Articles in Theory and Algorithms
Side Channel Detection Of Pc Rootkits Using Nonlinear Phase Space, Rebecca Clark
Side Channel Detection Of Pc Rootkits Using Nonlinear Phase Space, Rebecca Clark
Poster Presentations
Cyberattacks are increasing in size and scope yearly, and the most effective and common means of attack is through malicious software executed on target devices of interest. Malware threats vary widely in terms of behavior and impact and, thus, effective methods of detection are constantly being sought from the academic research community to offset both volume and complexity. Rootkits are malware that represent a highly feared threat because they can change operating system integrity and alter otherwise normally functioning software. Although normal methods of detection that are based on signatures of known malware code are the standard line of defense, …
Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia
Reducing Food Scarcity: The Benefits Of Urban Farming, S.A. Claudell, Emilio Mejia
Journal of Nonprofit Innovation
Urban farming can enhance the lives of communities and help reduce food scarcity. This paper presents a conceptual prototype of an efficient urban farming community that can be scaled for a single apartment building or an entire community across all global geoeconomics regions, including densely populated cities and rural, developing towns and communities. When deployed in coordination with smart crop choices, local farm support, and efficient transportation then the result isn’t just sustainability, but also increasing fresh produce accessibility, optimizing nutritional value, eliminating the use of ‘forever chemicals’, reducing transportation costs, and fostering global environmental benefits.
Imagine Doris, who is …
Chatgpt As Metamorphosis Designer For The Future Of Artificial Intelligence (Ai): A Conceptual Investigation, Amarjit Kumar Singh (Library Assistant), Dr. Pankaj Mathur (Deputy Librarian)
Chatgpt As Metamorphosis Designer For The Future Of Artificial Intelligence (Ai): A Conceptual Investigation, Amarjit Kumar Singh (Library Assistant), Dr. Pankaj Mathur (Deputy Librarian)
Library Philosophy and Practice (e-journal)
Abstract
Purpose: The purpose of this research paper is to explore ChatGPT’s potential as an innovative designer tool for the future development of artificial intelligence. Specifically, this conceptual investigation aims to analyze ChatGPT’s capabilities as a tool for designing and developing near about human intelligent systems for futuristic used and developed in the field of Artificial Intelligence (AI). Also with the helps of this paper, researchers are analyzed the strengths and weaknesses of ChatGPT as a tool, and identify possible areas for improvement in its development and implementation. This investigation focused on the various features and functions of ChatGPT that …
Parallel Algorithms For Scalable Graph Mining: Applications On Big Data And Machine Learning, Naw Safrin Sattar
Parallel Algorithms For Scalable Graph Mining: Applications On Big Data And Machine Learning, Naw Safrin Sattar
University of New Orleans Theses and Dissertations
Parallel computing plays a crucial role in processing large-scale graph data. Complex network analysis is an exciting area of research for many applications in different scientific domains e.g., sociology, biology, online media, recommendation systems and many more. Graph mining is an area of interest with diverse problems from different domains of our daily life. Due to the advancement of data and computing technologies, graph data is growing at an enormous rate, for example, the number of links in social networks is growing every millisecond. Machine/Deep learning plays a significant role for technological accomplishments to work with big data in modern …
Optimized Damage Assessment And Recovery Through Data Categorization In Critical Infrastructure System., Shruthi Ramakrishnan
Optimized Damage Assessment And Recovery Through Data Categorization In Critical Infrastructure System., Shruthi Ramakrishnan
Graduate Theses and Dissertations
Critical infrastructures (CI) play a vital role in majority of the fields and sectors worldwide. It contributes a lot towards the economy of nations and towards the wellbeing of the society. They are highly coupled, interconnected and their interdependencies make them more complex systems. Thus, when a damage occurs in a CI system, its complex interdependencies make it get subjected to cascading effects which propagates faster from one infrastructure to another resulting in wide service degradations which in turn causes economic and societal effects. The propagation of cascading effects of disruptive events could be handled efficiently if the assessment and …
Side-Channel Analysis On Post-Quantum Cryptography Algorithms, Tristen Teague
Side-Channel Analysis On Post-Quantum Cryptography Algorithms, Tristen Teague
Computer Science and Computer Engineering Undergraduate Honors Theses
The advancements of quantum computers brings us closer to the threat of our current asymmetric cryptography algorithms being broken by Shor's Algorithm. NIST proposed a standardization effort in creating a new class of asymmetric cryptography named Post-Quantum Cryptography (PQC). These new algorithms will be resistant against both classical computers and sufficiently powerful quantum computers. Although the new algorithms seem mathematically secure, they can possibly be broken by a class of attacks known as side-channels attacks (SCA). Side-channel attacks involve exploiting the hardware that the algorithm runs on to figure out secret values that could break the security of the system. …
Unconventional Computation Including Quantum Computation, Bruce J. Maclennan
Unconventional Computation Including Quantum Computation, Bruce J. Maclennan
Faculty Publications and Other Works -- EECS
Unconventional computation (or non-standard computation) refers to the use of non-traditional technologies and computing paradigms. As we approach the limits of Moore’s Law, progress in computation will depend on going beyond binary electronics and on exploring new paradigms and technologies for information processing and control. This book surveys some topics relevant to unconventional computation, including the definition of unconventional computations, the physics of computation, quantum computation, DNA and molecular computation, and analog computation. This book is the content of a course taught at UTK.
Promoting Diversity In Academic Research Communities Through Multivariate Expert Recommendation, Omar Salman
Promoting Diversity In Academic Research Communities Through Multivariate Expert Recommendation, Omar Salman
Graduate Theses and Dissertations
Expert recommendation is the process of identifying individuals who have the appropriate knowledge and skills to achieve a specific task. It has been widely used in the educational environment mainly in the hiring process, paper-reviewer assignment, and assembling conference program committees. In this research, we highlight the problem of diversity and fair representation of underrepresented groups in expertise recommendation, factors that current expertise recommendation systems rarely consider. We introduce a novel way to model experts in academia by considering demographic attributes in addition to skills. We use the h-index score to quantify skills for a researcher and we identify five …
Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang
Lecture 06: The Impact Of Computer Architectures On The Design Of Algebraic Multigrid Methods, Ulrike Yang
Mathematical Sciences Spring Lecture Series
Algebraic multigrid (AMG) is a popular iterative solver and preconditioner for large sparse linear systems. When designed well, it is algorithmically scalable, enabling it to solve increasingly larger systems efficiently. While it consists of various highly parallel building blocks, the original method also consisted of various highly sequential components. A large amount of research has been performed over several decades to design new components that perform well on high performance computers. As a matter of fact, AMG has shown to scale well to more than a million processes. However, with single-core speeds plateauing, future increases in computing performance need to …
Investigating Single Precision Floating General Matrix Multiply In Heterogeneous Hardware, Steven Harris
Investigating Single Precision Floating General Matrix Multiply In Heterogeneous Hardware, Steven Harris
McKelvey School of Engineering Theses & Dissertations
The fundamental operation of matrix multiplication is ubiquitous across a myriad of disciplines. Yet, the identification of new optimizations for matrix multiplication remains relevant for emerging hardware architectures and heterogeneous systems. Frameworks such as OpenCL enable computation orchestration on existing systems, and its availability using the Intel High Level Synthesis compiler allows users to architect new designs for reconfigurable hardware using C/C++. Using the HARPv2 as a vehicle for exploration, we investigate the utility of several of the most notable matrix multiplication optimizations to better understand the performance portability of OpenCL and the implications for such optimizations on this and …
Nonlinear Least Squares 3-D Geolocation Solutions Using Time Differences Of Arrival, Michael V. Bredemann
Nonlinear Least Squares 3-D Geolocation Solutions Using Time Differences Of Arrival, Michael V. Bredemann
Mathematics & Statistics ETDs
This thesis uses a geometric approach to derive and solve nonlinear least squares minimization problems to geolocate a signal source in three dimensions using time differences of arrival at multiple sensor locations. There is no restriction on the maximum number of sensors used. Residual errors reach the numerical limits of machine precision. Symmetric sensor orientations are found that prevent closed form solutions of source locations lying within the null space. Maximum uncertainties in relative sensor positions and time difference of arrivals, required to locate a source within a maximum specified error, are found from these results. Examples illustrate potential requirements …
Quantum Computing: Principles And Applications, Yoshito Kanamori, Seong-Moo Yoo
Quantum Computing: Principles And Applications, Yoshito Kanamori, Seong-Moo Yoo
Journal of International Technology and Information Management
The development of quantum computers over the past few years is probably one of the significant advancements in the history of quantum computing. D-Wave quantum computer has been available for more than eight years. IBM has made its quantum computer accessible via its cloud service. Also, Microsoft, Google, Intel, and NASA have been heavily investing in the development of quantum computers and their applications. The quantum computer seems to be no longer just for physicists and computer scientists but also for information system researchers. This paper introduces the basic concepts of quantum computing and describes well-known quantum applications for non-physicists. …
Formally Designing And Implementing Cyber Security Mechanisms In Industrial Control Networks., Mehdi Sabraoui
Formally Designing And Implementing Cyber Security Mechanisms In Industrial Control Networks., Mehdi Sabraoui
Electronic Theses and Dissertations
This dissertation describes progress in the state-of-the-art for developing and deploying formally verified cyber security devices in industrial control networks. It begins by detailing the unique struggles that are faced in industrial control networks and why concepts and technologies developed for securing traditional networks might not be appropriate. It uses these unique struggles and examples of contemporary cyber-attacks targeting control systems to argue that progress in securing control systems is best met with formal verification of systems, their specifications, and their security properties. This dissertation then presents a development process and identifies two technologies, TLA+ and seL4, that can be …
An Underground Radio Wave Propagation Prediction Model For Digital Agriculture, Abdul Salam
An Underground Radio Wave Propagation Prediction Model For Digital Agriculture, Abdul Salam
Faculty Publications
Underground sensing and propagation of Signals in the Soil (SitS) medium is an electromagnetic issue. The path loss prediction with higher accuracy is an open research subject in digital agriculture monitoring applications for sensing and communications. The statistical data are predominantly derived from site-specific empirical measurements, which is considered an impediment to universal application. Nevertheless, in the existing literature, statistical approaches have been applied to the SitS channel modeling, where impulse response analysis and the Friis open space transmission formula are employed as the channel modeling tool in different soil types under varying soil moisture conditions at diverse communication distances …
Agent-Based Modeling And Simulation Approaches In Stem Education Research, Shanna R. Simpson-Singleton, Xiangdong Che
Agent-Based Modeling And Simulation Approaches In Stem Education Research, Shanna R. Simpson-Singleton, Xiangdong Che
Journal of International Technology and Information Management
The development of best practices that deliver quality STEM education to all students, while minimizing achievement gaps, have been solicited by several national agencies. ABMS is a feasible approach to provide insight into global behavior based upon the interactions amongst agents and environments. In this review, we systematically surveyed several modeling and simulation approaches and discussed their applications to the evaluation of relevant theories in STEM education. It was found that ABMS is optimal to simulate STEM education hypotheses, as ABMS will sensibly present emergent theories and causation in STEM education phenomena if the model is properly validated and calibrated.
Criticality Assessments For Improving Algorithmic Robustness, Thomas B. Jones
Criticality Assessments For Improving Algorithmic Robustness, Thomas B. Jones
Computer Science ETDs
Though computational models typically assume all program steps execute flawlessly, that does not imply all steps are equally important if a failure should occur. In the "Constrained Reliability Allocation" problem, sufficient resources are guaranteed for operations that prompt eventual program termination on failure, but those operations that only cause output errors are given a limited budget of some vital resource, insufficient to ensure correct operation for each of them.
In this dissertation, I present a novel representation of failures based on a combination of their timing and location combined with criticality assessments---a method used to predict the behavior of systems …
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Randomized Routing On Fat-Trees, Ronald I. Greenberg
Ronald Greenberg
Fat-trees are a class of routing networks for hardware-efficient parallel computation. This paper presents a randomized algorithm for routing messages on a fat-tree. The quality of the algorithm is measured in terms of the load factor of a set of messages to be routed, which is a lower bound on the time required to deliver the messages. We show that if a set of messages has load factor lambda on a fat-tree with n processors, the number of delivery cycles (routing attempts) that the algorithm requires is O(lambda+lgnlglgn) with probability 1-O(1/ …
An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan
An Improved Analytical Model For Wormhole Routed Networks With Application To Butterfly Fat-Trees, Ronald I. Greenberg, Lee Guan
Ronald Greenberg
A performance model for wormhole routed interconnection networks is presented and applied to the butterfly fat-tree network. Experimental results agree very closely over a wide range of load rate. Novel aspects of the model, leading to accurate and simple performance predictions, include (1) use of multiple-server queues, and (2) a general method of correcting queuing results based on Poisson arrivals to apply to wormhole routing. These ideas can also be applied to other networks.
Process Models Discovery And Traces Classification: A Fuzzy-Bpmn Mining Approach., Kingsley Okoye Dr, Usman Naeem Dr, Syed Islam Dr, Abdel-Rahman H. Tawil Dr, Elyes Lamine Dr
Process Models Discovery And Traces Classification: A Fuzzy-Bpmn Mining Approach., Kingsley Okoye Dr, Usman Naeem Dr, Syed Islam Dr, Abdel-Rahman H. Tawil Dr, Elyes Lamine Dr
Journal of International Technology and Information Management
The discovery of useful or worthwhile process models must be performed with due regards to the transformation that needs to be achieved. The blend of the data representations (i.e data mining) and process modelling methods, often allied to the field of Process Mining (PM), has proven to be effective in the process analysis of the event logs readily available in many organisations information systems. Moreover, the Process Discovery has been lately seen as the most important and most visible intellectual challenge related to the process mining. The method involves automatic construction of process models from event logs about any domain …
Adaft: A Resource-Efficient Framework For Adaptive Fault-Tolerance In Cyber-Physical Systems, Ye Xu
Adaft: A Resource-Efficient Framework For Adaptive Fault-Tolerance In Cyber-Physical Systems, Ye Xu
Doctoral Dissertations
Cyber-physical systems frequently have to use massive redundancy to meet application requirements for high reliability. While such redundancy is required, it can be activated adaptively, based on the current state of the controlled plant. Most of the time the physical plant is in a state that allows for a lower level of fault-tolerance. Avoiding the continuous deployment of massive fault-tolerance will greatly reduce the workload of CPSs. In this dissertation, we demonstrate a software simulation framework (AdaFT) that can automatically generate the sub-spaces within which our adaptive fault-tolerance can be applied. We also show the theoretical benefits of AdaFT, and …
Power-Efficient And Highly Scalable Parallel Graph Sampling Using Fpgas, Usman Tariq, Umer Cheema, Fahad Saeed
Power-Efficient And Highly Scalable Parallel Graph Sampling Using Fpgas, Usman Tariq, Umer Cheema, Fahad Saeed
Parallel Computing and Data Science Lab Technical Reports
Energy efficiency is a crucial problem in data centers where big data is generally represented by directed or undirected graphs. Analysis of this big data graph is challenging due to volume and velocity of the data as well as irregular memory access patterns. Graph sampling is one of the most effective ways to reduce the size of graph while maintaining crucial characteristics. In this paper we present design and implementation of an FPGA based graph sampling method which is both time- and energy-efficient. This is in contrast to existing parallel approaches which include memory-distributed clusters, multicore and GPUs. Our …
Machs: Mitigating The Achilles Heel Of The Cloud Through High Availability And Performance-Aware Solutions, Manar Jammal
Machs: Mitigating The Achilles Heel Of The Cloud Through High Availability And Performance-Aware Solutions, Manar Jammal
Electronic Thesis and Dissertation Repository
Cloud computing is continuously growing as a business model for hosting information and communication technology applications. However, many concerns arise regarding the quality of service (QoS) offered by the cloud. One major challenge is the high availability (HA) of cloud-based applications. The key to achieving availability requirements is to develop an approach that is immune to cloud failures while minimizing the service level agreement (SLA) violations. To this end, this thesis addresses the HA of cloud-based applications from different perspectives. First, the thesis proposes a component’s HA-ware scheduler (CHASE) to manage the deployments of carrier-grade cloud applications while maximizing their …
Climbing Up Cloud Nine: Performance Enhancement Techniques For Cloud Computing Environments, Mohamed Abusharkh
Climbing Up Cloud Nine: Performance Enhancement Techniques For Cloud Computing Environments, Mohamed Abusharkh
Electronic Thesis and Dissertation Repository
With the transformation of cloud computing technologies from an attractive trend to a business reality, the need is more pressing than ever for efficient cloud service management tools and techniques. As cloud technologies continue to mature, the service model, resource allocation methodologies, energy efficiency models and general service management schemes are not yet saturated. The burden of making this all tick perfectly falls on cloud providers. Surely, economy of scale revenues and leveraging existing infrastructure and giant workforce are there as positives, but it is far from straightforward operation from that point. Performance and service delivery will still depend on …
Sustainable Resource Management For Cloud Data Centers, A. S. M. Hasan Mahmud
Sustainable Resource Management For Cloud Data Centers, A. S. M. Hasan Mahmud
FIU Electronic Theses and Dissertations
In recent years, the demand for data center computing has increased significantly due to the growing popularity of cloud applications and Internet-based services. Today's large data centers host hundreds of thousands of servers and the peak power rating of a single data center may even exceed 100MW. The combined electricity consumption of global data centers accounts for about 3% of worldwide production, raising serious concerns about their carbon footprint. The utility providers and governments are consistently pressuring data center operators to reduce their carbon footprint and energy consumption. While these operators (e.g., Apple, Facebook, and Google) have taken steps to …
Front Matter: Proceedings Of The Maics 2016 Conference, University Of Dayton
Front Matter: Proceedings Of The Maics 2016 Conference, University Of Dayton
Content presented at the MAICS conference
Front matter contains:
- A list of program chairs and committee members
- Foreword to the proceedings by James P. Buckley, conference chair; Saverio Perugini, general chair
Editors: Phu H. Phung, University of Dayton; Ju Shen, University of Dayton; Michael Glass, Valparaiso University
Ultimate Codes: Near-Optimal Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Chong Wang, Ke Zhou, Yuhong Zhao
Ultimate Codes: Near-Optimal Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Chong Wang, Ke Zhou, Yuhong Zhao
CSE Technical Reports
As modern storage systems have grown in size and complexity, RAID-6 is poised to replace RAID-5 as the dominant form of RAID architectures due to its ability to protect against double disk failures. Many excellent erasure codes specially designed for RAID-6 have emerged in recent years. However, all of them have limitations. In this paper, we present a class of near perfect erasure codes for RAID-6, called the Ultimate codes. These codes encode, update and decode either optimally or nearly optimally, regardless of what the code length is. This implies that utilizing these codes we can build highly efficient and …
S-Code: Lowest Density Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Ke Zhou, Yuhong Zhao, Chong Wang
S-Code: Lowest Density Mds Array Codes For Raid-6, Zhijie Huang, Hong Jiang, Ke Zhou, Yuhong Zhao, Chong Wang
CSE Technical Reports
RAID, a storage architecture designed to exploit I/O parallelism and provide data reliability, has been deployed widely in computing systems as a storage building block. In large scale storage systems, in particular, RAID-6 is gradually replacing RAID-5 as the dominant form of disk arrays due to its capability of tolerating concurrent failures of any two disks. MDS (maximum distance separable) array codes are the most popular erasure codes that can be used for implementing RAID-6, since they enable optimal storage efficiency and efficient encoding and decoding algorithms. In this paper, we propose a new class of MDS array codes called …
Regen: Optimizing Genetic Selection Algorithms For Heterogeneous Computing, Scott Kenneth Swinkleb Winkleblack
Regen: Optimizing Genetic Selection Algorithms For Heterogeneous Computing, Scott Kenneth Swinkleb Winkleblack
Master's Theses
GenSel is a genetic selection analysis tool used to determine which genetic markers are informational for a given trait. Performing genetic selection related analyses is a time consuming and computationally expensive task. Due to an expected increase in the number of genotyped individuals, analysis times will increase dramatically. Therefore, optimization efforts must be made to keep analysis times reasonable.
This thesis focuses on optimizing one of GenSel’s underlying algorithms for heterogeneous computing. The resulting algorithm exposes task-level parallelism and data-level parallelism present but inaccessible in the original algorithm. The heterogeneous computing solution, ReGen, outperforms the optimized CPU implementation achieving a …
Real-Time Scheduling Of Embedded Applications On Multi-Core Platforms, Ming Fan
Real-Time Scheduling Of Embedded Applications On Multi-Core Platforms, Ming Fan
FIU Electronic Theses and Dissertations
For the past several decades, we have experienced the tremendous growth, in both scale and scope, of real-time embedded systems, thanks largely to the advances in IC technology. However, the traditional approach to get performance boost by increasing CPU frequency has been a way of past. Researchers from both industry and academia are turning their focus to multi-core architectures for continuous improvement of computing performance. In our research, we seek to develop efficient scheduling algorithms and analysis methods in the design of real-time embedded systems on multi-core platforms. Real-time systems are the ones with the response time as critical as …
Collaborative Policy-Based Autonomic Management In Iaas Clouds, Omid Mola
Collaborative Policy-Based Autonomic Management In Iaas Clouds, Omid Mola
Electronic Thesis and Dissertation Repository
With the increasing number of "machines" (either virtual or physical) in a computing environment, it is becoming harder to monitor and manage these resources. Relying on human administrators, even with tools, is expensive and the growing complexity makes management even harder. The alternative is to look for automated approaches that can monitor and manage computing resources in real time with no human intervention. One of the approaches to this problem is policy-based autonomic management. However, in large systems having one single autonomic manager to manage everything is almost impossible. Therefore, multiple autonomic managers will be needed and these will need …