Systems Architecture Commons^™

Generalized Construction Of Scalable Concurrent Data Structures Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Philip W. Howard, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We present relativistic programming, a concurrent programming model based on shared addressing, which supports efficient, scalable operation on either uniform shared-memory or distributed shared- memory systems. Relativistic programming provides a strong causal ordering property, allowing a series of read operations to appear as an atomic transaction that occurs entirely between two ordered write operations. This preserves the simple immutable-memory programming model available via mutual exclusion or transactional memory. Furthermore, relativistic programming provides joint-access parallelism, allowing readers to run concurrently with a writer on the same data. We demonstrate a generalized construction technique for concurrent data structures based on relativistic programming, …

Scalable Correct Memory Ordering Via Relativistic Programming, Josh Triplett, Philip William Howard, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We propose and document a new concurrent programming model, relativistic programming. This model allows readers to run concurrently with writers, without blocking or using expensive synchronization. Relativistic programming builds on existing synchronization primitives that allow writers to wait for current readers to finish with minimal reader overhead. Our methodology models data structures as graphs, and reader algorithms as traversals of these graphs; from this foundation we show how writers can implement arbitrarily strong ordering guarantees for the visibility of their writes, up to and including total ordering.

A Comparison Of Relativistic And Reader-Writer Locking Approaches To Shared Data Access, Philip William Howard, Josh Triplett, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This paper explores the relationship between reader-writer locking and relativistic programming approaches to managing accesses to shared data. It demonstrates that by placing certain restrictions on writers, relativistic programming allows more concurrency than reader-writer locking while still providing the same isolation guarantees. Relativistic programming also allows for a straightforward model for reasoning about the correctness of programs that allow concurrent read-write accesses.

Executable Architecture Research At Old Dominion University, Andreas Tolk, Johnny J. Garcia, Edwin A. Shuman

Computational Modeling & Simulation Engineering Faculty Publications

Executable Architectures allow the evaluation of system architectures not only regarding their static, but also their dynamic behavior. However, the systems engineering community do not agree on a common formal specification of executable architectures. To close this gap and identify necessary elements of an executable architecture, a modeling language, and a modeling formalism is topic of ongoing PhD research. In addition, systems are generally defined and applied in an operational context to provide capabilities and enable missions. To maximize the benefits of executable architectures, a second PhD effort introduces the idea of creating an executable context in addition to the …

Linux 101: Ci-Trainseminar, Edward Aractingi

IT Research

An overview of how the Linux operating system.

Adopting Virtualized 10gbe Ethernet Iscsi San For Mission Critical Applications, Edward Aractingi, Allen Taylor, David Griggs

IT Research

The presentation will provide insight into the decision to move from a fibre channel SAN solution, the resulting performance metrics and financial savings seen by Marshall University. Presented at The Ohio Higher Education Computing Council (OHECC) March 23, 2011.

Performance Modeling Of Distributed Collaboration Services, Toqeer A. Israr, Gregor V. Bochmann

Faculty Research & Creative Activity

This paper deals with performance modeling of distributed applications, service compositions and workflow systems. From the functional perspective, the distributed application is modeled as a collaboration involving several roles, and its behavior is defined in terms of a composition from several sub-collaborations using the standard sequencing operators found in UML Activity Diagrams and similar formalisms. For the performance perspective, each collaboration is characterized by a certain number of independent input events and dependent output events, and the performance of the collaboration is defined by the minimum delays that apply for a given output event in respect to each input event …

A Machine-Learning Approach For Workflow Identification From Low-Level Monitoring Information, Thorsten Stein

Theses

Knowing which workflows are executed within Service Oriented Architectures (SOA) is essential for successful IT management. In many cases, SOAs grew out of previous existing IT architectures; existing components are used as single services and therefore as parts of newly created workflows. Since such workflows consist of newly developed and legacy services, traditional workflow management systems often cannot be applied. This thesis presents a method for gathering information about the executed workflows within such heterogeneous environments. An implementation of a framework is presented. This framework allows the training of machine-learning algorithms with workflow models and the mapping of low-level monitoring …

The Ordering Requirements Of Relativistic And Reader-Writer Locking Approaches To Shared Data Access, Philip William Howard, Josh Triplett, Jonathan Walpole, Paul E. Mckenney

Computer Science Faculty Publications and Presentations

The semantics of reader-writer locks allow read-side concurrency. Unfortunately, the locking primitives serialize access to the lock variable to an extent that little or no concurrency is realized in practice for small critical sections. Relativistic programming is a methodology that also allows read- side concurrency. Relativistic programming uses dfferent ordering constraints than reader-writer locking. The different ordering constraints allow relativistic readers to proceed without synchronization so relativistic readers scale even for very short critical sections. In this paper we explore the diferences between the ordering constraints for reader-writer locking and relativistic programs. We show how and why the dfferent ordering …

Random Automata Networks: Why Playing Dice Is Not A Vice, Christof Teuscher

Systems Science Friday Noon Seminar Series

Random automata networks consist of a set of simple compute nodes interacting with each other. In this generic model, one or multiple model parameters, such as the the node interactions and/or the compute functions, are chosen at random. Random Boolean Networks (RBNs) are a particular case of discrete dynamical automata networks where both time and states are discrete. While traditional RBNs are generally credited to Stuart Kauffman (1969), who introduced them as simplified models of gene regulation, Alan Turing proposed unorganized machines as early as 1948. In this talk I will start with Alan Turing's early work on unorganized machines, …

Analysis Of False Cache Line Sharing Effects On Multicore Cpus, Suntorn Sae-Eung

Master's Projects

False sharing (FS) is a well-known problem occurring in multiprocessor systems. It results in performance degradation on multi-threaded programs running on multiprocessor environments.

With the evolution of processor architecture over time, the multicore processor is a recent direction used by hardware designers to increase performance while avoiding heat and power walls. To fully exploit the processing power from these multicore hardware architectures, the software programmer needs to build applications using parallel programming concepts, which are based upon multi-threaded programming principles.

Since the architecture of a multicore processor is very similar to a multiprocessor system, the presence of the false sharing …

Ibm Power Systems And Service Oriented Architecture At Bank Of America’S Foreign Items Systems Office, Keng Siau, D. Dewester

Research Collection School Of Computing and Information Systems

This is a teaching case on a real life scenario in an organization involving IT solution evaluation and selection. This case involves the Bank of America’s Foreign Items Systems office in Toronto. The officers from the Bank of America’s Foreign Items Systems office in Toronto were discussing how to respond to a Request for Proposal (RFP) from a major U.S. bank to provide foreign currency services. The case discusses three options: Standard J2EE Web Application Global Foreign Currency, Modified J2EE Web Application with Single Sign On, and Service-Oriented Architecture (SOA) via Web Services. The case can be used to complement …

Assessing Vulnerabilities Of Biometric Readers Using An Applied Defeat Evaluation Methodology, David Brooks

Australian Security and Intelligence Conference

Access control systems using biometric identification readers are becoming common within critical infrastructure and other high security applications. There is a perception that biometric, due to their ability to identify and validate the user, are more secure. However, biometric systems are vulnerable to many categories of attack vectors and there has been restricted research into such defeat vulnerabilities. This study expands on a past article (Brooks, 2009) that presented a defeat evaluation methodology applied to high-security biometric readers. The defeat methodology is represented, but applied to both fingerprint and back-of-hand biometric readers. Defeat evaluation included both physical and technical integrity …

Program Transformations For Information Personalization, Saverio Perugini, Naren Ramakrishnan

Computer Science Faculty Publications

Personalization constitutes the mechanisms necessary to automatically customize information content, structure, and presentation to the end user to reduce information overload. Unlike traditional approaches to personalization, the central theme of our approach is to model a website as a program and conduct website transformation for personalization by program transformation (e.g., partial evaluation, program slicing). The goal of this paper is study personalization through a program transformation lens and develop a formal model, based on program transformations, for personalized interaction with hierarchical hypermedia. The specific research issues addressed involve identifying and developing program representations and transformations suitable for classes of hierarchical …

Increasing Effectiveness Of The Zachman Framework Using The Balanced Scorecard, Anagha Gokhale

Purdue Polytechnic Masters Theses

The purpose of this study is to explore the impact of integrating the use of Zachman Framework of Enterprise Architecture and the Balanced Scorecard (BSC) Framework for an effective business-IT alignment. The study tries to identify certain gaps in the Zachman Framework focusing on the motivational aspects of the framework, which have been discussed in the literature review. The aim is to achieve the integration by mitigating these motivational aspect’s weaknesses in the Zachman Framework using the deliverables obtained from the BSC. Thus the author proposes to achieve business-IT alignment through this integration. No research studies in the past have …

A Study Of Improving The Parallel Performance Of Vasp., Matthew Brandon Baker

Electronic Theses and Dissertations

This thesis involves a case study in the use of parallelism to improve the performance of an application for computational research on molecules. The application, VASP, was migrated from a machine with 4 nodes and 16 single-threaded processors to a machine with 60 nodes and 120 dual-threaded processors. When initially migrated, VASP's performance deteriorated after about 17 processing elements (PEs), due to network contention. Subsequent modifications that restrict communication amongst VASP processes, together with additional support for threading, allowed VASP to scale up to 112 PEs, the maximum number that was tested. Other performance-enhancing optimizations that were attempted included replacing …

Integrating Recommender Information In Social Ecosystems Decisions, Renato A C Capuruco, Luiz Fernando Capretz

Electrical and Computer Engineering Publications

The exploration of online social networks whose members share mutual recommendations and interactions is a time-dependent and contextual-based process which aims to predict the social status among members, ultimately improving the network's discoverability to achieve societal gain. To address the difficulties associated with the process, this article presents an integrated recommender model whose statements are time-dependent, interaction-aware, and social context-sensitive. The originality of the proposed model stems from the integration of the predictive recommender, social networks, and interaction components. Each model is developed based on: (1) a time history and decay algorithm to consider the decreasing intensity of recommendations among …

St. Jude Medical: An Object-Oriented Software Architecture For Embedded And Real-Time Medical Devices, Atila Amiri

Master's Theses

Medical devices used for surgical or therapeutic purposes require a high degree of safety and effectiveness. Software is critical component of many such medical devices. The software architecture of a system defines organizational structure and the runtime characteristic of the application used to control the operation of the system and provides a set of frameworks that are used to develop that. As such, the design of software architecture is a critical element in achieving the intended functionality, performance, and safety requirements of a medical device. This architecture uses object-oriented design techniques, which model the underlying system as a set of …

Reducing Cluster Power Consumption By Dynamically Suspending Idle Nodes, Brian Michael Oppenheim

Master's Theses

Close to 1% of the world's electricity is consumed by computer servers. Given that the increased use of electricity raises costs and damages the environment, optimizing the world's computing infrastructure for power consumption is worthwhile. This thesis is one attempt at such an optimization. In particular, I began by building a cluster of 6 Intel Atom based low-power nodes to perform work analogous to data center clusters. Then, I installed a version of Hadoop modified with a novel power management system on the cluster. The power management system uses different algorithms to determine when to turn off idle nodes in …

Focused Multi-Document Summarization: Human Summarization Activity Vs. Automated Systems Techniques, Quinsulon L. Israel, Hyoil Han, Il-Yeol Song

Computer Sciences and Electrical Engineering Faculty Research

Focused Multi-Document Summarization (MDS) is concerned with summarizing documents in a collection with a concentration toward a particular external request (i.e. query, question, topic, etc.), or focus. Although the current state-of-the-art provides somewhat decent performance for DUC/TAC-like evaluations (i.e. government and news concerns), other considerations need to be explored. This paper not only briefly explores the state-of-the-art in automatic systems techniques, but also a comparison with human summarization activity.