Category Archives: Computer Science

Soner Onder Presents Talk in Barcelona, Spain

Soner Onder is pictured on the right in the front.

Sonder Onder (SAS), professor of computer science, presented an invited talk at “Yale:80: Pushing the Envelope of Computing for the Future,” held July 1-2, 2019, in Barcelona, Spain. The workshop was organized by Universitat Politècnica de Catalunya in honor of the 80th birthday of Yale Patt, a prominent computer architecture researcher. Onder was one of 23 invitees to give a talk. His lecture was titled, “Program semantics meets architecture: What if we did not have branches?”

View the slides from Onder’s talk: Yale80-in-2019-Soner-Onder

Yale Patt is a professor in the Department of Electrical & Computer Engineering at The University of Texas at Austin, where he holds the Ernest Cockrell, Jr. Centennial Chair in Engineering. He also holds the title of University Distinguished Teaching Professor. Patt was elected to the National Academy of Engineering in 2014, among the highest professional distinctions bestowed upon an engineer. View Patt’s faculty webpage at: http://www.ece.utexas.edu/people/faculty/yale-patt.

Link to the workshop’s website here: http://research.ac.upc.edu/80-in-2019/

Visit the workshop’s Facebook page here: https://www.facebook.com/BSCCNS/posts/workshop-yale-80-in-2019pushing-the-envelope-of-computing-for-the-futurehttprese/2217508564992996/

Soner Onder, Barcelona, Spain
Soner Onder at Sagrada Família, Barcelona, Spain

Soner Onder Presents Keynote at SAMOS XIX

Soner Onder
Soner Onder

Soner Onder (SAS), professor of computer science, presented a keynote lecture July 8, 2019, at the International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation (SAMOS XIX) on Samos Island, Greece, which was held July 7-11. Onder’s talk was titled, “Form Follows Function: The Case for Homogeneous Computer Architectures.” Onder also participated in the conference’s “The Annual Open Mike Panel.”

Keynote Lecture Abstract: ”Form follows function” is a principle associated with 20th-century modernist architecture and industrial design which says that the shape of a building or object should primarily relate to its intended function or purpose”[2]. For best performance in computer architecture, form must follow function as well. What are form and function in computer architecture? Form is easy to understand and interpret in its dictionary meaning; Function is not so clear-cut. In this talk, I will start with a simple problem, an algorithm, and a basic program representation that will be interpreted by the machine, and show that delivering high performance rests on solving only a handful, but fundamentally difficult problems. I will argue that the mere existence of domain specific solutions that general purpose computing cannot match in performance is a testament that the general purpose computing is ”not general enough”. What makes an architecture ”not general enough” is not the architecture itself, but rather the mismatch between the function its form had followed and the actual semantics of programs. To illustrate the point, I will challenge the widely understood interpretation of instruction-level parallelism (ILP) as ”single-thread performance”, and show that this interpretation is too short-sighted. We can efficiently exploit all types of available parallelism, including process-level, thread-level and data level parallelism, all at the instruction-level, and this approach is both feasible and necessary to combat the complexity that is plaguing our profession. I will then discuss why an executable single-assignment program representation [1] may be the ultimate function whose implementations may result in homogeneous general purpose architectures that can potentially match the performance of accelerators for specific tasks, while exceeding the performance of any accelerator traditional architecture combination for general tasks. I will conclude by discussing our results with Demand-driven Execution (DDE), whose form follows this single-assignment program representation.

About SAMOS (from http://samos-conference.com/): SAMOS is a unique conference. It deals with embedded systems (sort of) but that is not what makes it different. It brings together every year researchers from both academia and industry on the quiet and inspiring northern mountainside of the Mediterranean island of Samos, which in itself is different. But more importantly, it really fosters collaboration rather than competition. Formal and intensive technical sessions are only held in the mornings.A lively panel or distinguished keynote speaker ends the formal part of the day, and leads nicely into the afternoons and evenings — reserved for informal discussions, good food, and the inviting Aegean Sea. The conference papers will be published by Springer’s Lecture Notes in Computer Science – LNCS and will be included in the DBLP Database.

Samos Island, Greece
Samos Island, Greece

Ali Ebnenasir is Co-author of Article in ACM Transactions on Computational Logic

Ali EbnenasirAli Ebnenasir (SAS/CS), professor of computer science, is co-author of the article, “On the verification of livelock-freedom and self-stabilization on parameterized rings,” published in the July 2019 issue of the journal ACM Transactions on Computational Logic. The article is co-authored by Alex Klinkhamer of Google.

Abstract: This article investigates the verification of livelock-freedom and self-stabilization on parameterized rings consisting of symmetric, constant space, deterministic, and self-disabling processes. The results of this article have a significant impact on several fields, including scalable distributed systems, resilient and self-* systems, and verification of parameterized systems. First, we identify necessary and sufficient local conditions for the existence of global livelocks in parameterized unidirectional rings with unbounded (but finite) number of processes under the interleaving semantics. Using a reduction from the periodic domino problem, we show that, in general, verifying livelock-freedom of parameterized unidirectional rings is undecidable (specifically, Π10-complete) even for constant space, deterministic, and self-disabling processes. This result implies that verifying self-stabilization for parameterized rings of self-disabling processes is also undecidable. We also show that verifying livelock-freedom and self-stabilization remain undecidable under (1) synchronous execution semantics, (2) the FIFO consistency model, and (3) any scheduling policy. We then present a new scope-based method for detecting and constructing livelocks in parameterized rings. The proposed semi-algorithm behind our scope-based verification is based on a novel paradigm for the detection of livelocks that totally circumvents state space exploration. Our experimental results on an implementation of the proposed semi-algorithm are very promising as we have found livelocks in parameterized rings in a few microseconds on a regular laptop. The results of this article have significant implications for scalable distributed systems with cyclic topologies.

Citation: Klinkhamer, A., & Ebnenasir, A. (2019). On the verification of livelock-freedom and self-stabilization on parameterized rings. ACM Transactions on Computational Logic, 20(3), 16:1-16:36. http://dx.doi.org/10.1145/3326456

MTU Digital Commons link: https://digitalcommons.mtu.edu/michigantech-p/146/

ACM link: https://dl.acm.org/citation.cfm?doid=3338853.3326456


Computer Science Faculty Students Attend Innovation and Technology Conference

Computer Science doctoral candidate Briana Bettin

The College of Computing and the Computer Science Department were well represented at the 24th Annual Conference on Innovation and Technology in Computer Science Education  (ITiCSE 19), July 14-17, at University of Aberdeen, Aberdeen, Scotland.

Senior Lecturer Leo Ureel, along with  James Heliotis,  professor of computer science at Rochester (New York) Institute of Technology, led a working group titled, “Towards an Ability to Direct College Students to an Appropriately Paced Introductory Computer Science Course.” Professor Linda Ott and Associate Professor Charles Wallace participated in the working group, “1.5 Degrees of Separation: Computer Science Education in the Age of the Anthropocene.”

PhD student Briana Bettin presented her paper, “More Effective Contextualization of CS Education Research: A Pair-Programming Example,” co-authored with Linda Ott and Leo Ureel.  Charles Wallace presented his poster, “A Prototype MATLAB Code Critiquer,” co-authored with Leo Ureel and undergraduate computer science student Marissa Walther.  Associate Professor Jean Mayo (ICC/CyberS) presented, ” Teaching Integer Security Using Simple Visualizations,” co-authored with Lecturer James Walker, recent PhD graduate Man Wang, Adjunct Professor and Professor and Chair of Computer Science at Western Michigan University Steven Carr, and Professor Ching-Kuang Shene.  Also attending the conference was computer science undergraduate Miriam Eikenberry-Ureel.

 


Bo Chen is PI of $200K NSF Research and Development Grant

Bo Chen, Assistant Professor of Computer Science

Bo Chen (Comp Sci/ICC) is Principal Investigator on a project that has received a $199,975 research and development grant from the National Science Foundation. The project is titled “EAGER: Enabling Secure Data Recovery for Mobile Devices Against Malicious Attacks.” This is a potential two-year project.

Abstract: Mainstream mobile computing devices like smart phones and tablets currently rely on remote backups for data recovery upon failures. For example, an iPhone periodically stores a recent snapshot to iCloud, and can get restored if needed. Such a commonly used “off-device” backup mechanism, however, suffers from a fundamental limitation that, the backup in the remote server is not always synchronized with data stored in the local device. Therefore, when a mobile device suffers from a malware attack, it can only be restored to a historical state using the remote backup, rather than the exact state right before the attack occurs. Data are extremely valuable for both organizations and individuals, and thus after the malware attack, it is of paramount importance to restore the data to the exact point (i.e., the corruption point) right before they are corrupted. This, however, is a challenging problem. The project addresses this problem in mobile devices and its outcome could benefit billions of mobile users.

A primary goal of the project is to enable recovery of mobile devices to the corruption point after malware attacks. The malware being considered is the OS-level malware which can compromise the OS and obtain the OS-level privilege. To achieve this goal, the project combines both the traditional off-device data recovery and a novel in-device data recovery. Especially, the following research activities are undertaken: 1) Designing a novel malware detector which runs in flash translation layer (FTL), a firmware layer staying between OS and flash memory hardware. The FTL-based malware detector ensures that data being committed to the remote server will not be tampered with by the OS-level malware. 2) Developing a novel approach which ensures that the OS-level malware is not able to corrupt data changes (i.e., delta) which have not yet been committed to the remote server. This is achieved by hiding the delta in the flash memory using flash storage’s special hardware features, i.e., out-of-place update and strong physical isolation. 3) Developing a user-friendly approach which can allow users to conveniently and efficiently retrieve the delta hidden in the flash memory for data recovery after malware attacks.

Link to an Unscripted article about related research at  https://www.mtu.edu/unscripted/stories/2018/march/how-to-speed-up-bare-metal-malware-analysis-and-better-protect-mobile-devices.html.


Ali Ebnenasir is Co-Author of Publication in ACM Transactions on Computational Logic

Ali Ebnenasir
Ali Ebnenasir

An article co-authored by Ali Ebnenasir (SAS/CS) and Alex Klinkhamer, “Verification of Livelock-Freedom and Self-Stabilization on Parameterized Rings,” was recently published in ACM Transactions on Computational Logic.

Abstract: This article investigates the verification of livelock-freedom and self-stabilization on parameterized rings consisting of symmetric, constant space, deterministic, and self-disabling processes. The results of this article have a significant impact on several fields, including scalable distributed systems, resilient and self-* systems, and verification of parameterized systems. First, we identify necessary and sufficient local conditions for the existence of global livelocks in parameterized unidirectional rings with unbounded (but finite) number of processes under the interleaving semantics. Using a reduction from the periodic domino problem, we show that, in general, verifying livelock-freedom of parameterized unidirectional rings is undecidable (specifically, Π10-complete) even for constant space, deterministic, and self-disabling processes. This result implies that verifying self-stabilization for parameterized rings of self-disabling processes is also undecidable. We also show that verifying livelock-freedom and self-stabilization remain undecidable under (1) synchronous execution semantics, (2) the FIFO consistency model, and (3) any scheduling policy. We then present a new scope-based method for detecting and constructing livelocks in parameterized rings. The proposed semi-algorithm behind our scope-based verification is based on a novel paradigm for the detection of livelocks that totally circumvents state space exploration. Our experimental results on an implementation of the proposed semi-algorithm are very promising as we have found livelocks in parameterized rings in a few microseconds on a regular laptop. The results of this article have significant implications for scalable distributed systems with cyclic topologies.

https://dl.acm.org/citation.cfm?id=3326456&dl=ACM&coll=DL

doi: 10.1145/3326456


Soner Onder to Give Invited Talk

Soner Onder
Soner Onder

Tech Today announced that Soner Onder (CS) is giving an invited talk titled “Program semantics meets architecture: What if we did not have branches?” at a workshop organized in honor of the 80th birthday of Yale Patt of University of Texas, Austin. Patt is a very prominent researcher with decades of accomplishments in Computer Architecture.

The workshop titled “Yale: 80 in 2019, Pushing the Envelope of Computing for the Future” scheduled to take place on July 1-2, 2019 in Barcelona, Spain, is organized by Universitat Politècnica de Catalunya and Barcelona Supercomputing Center, and is being sponsored by Ministerio de Ciencia, Innovación y Universidades (Ministry of Science, Innovation and Universities) of Spain, among others.



Grant Funds Virtual Keyboard Research

What if an everyday surface, like a table, could be transformed into a rich, interactive surface that can remotely operate things like computers, entertainment systems, and home appliances?

That’s what Michigan Tech Institute of Computing and Cybersystems (ICC) researchers Keith Vertanen (CS)  and Scott Kuhl (CS) set out to do with a $44,000 seed grant from Electrical and Computer Engineering alumnus Paul Williams ’61.

Vertanen and Kuhl are members of the ICC’s Center for Human-Centered Computing, which integrates art, people, design, technology and human experience in the research of multiple areas of human-centered computing. They were assisted in this research by PhD candidate Siva Krishna Kakula, and undergraduate Zachary Garavet.

The team’s research goals were threefold:

  • To create machine learning models that can precisely locate a user’s taps on a surface using only an array of inexpensive surface microphones
  • To demonstrate the feasibility and precision of the models by developing a virtual keyboard interface on an ordinary wooden table
  • To conduct user studies to validate the system’s usability and performance.

Read the full story.


ICC Achievement Awards

At the annual awards banquet of the Michigan Tech Institute of Computing and Cybersysytems (ICC), on Friday, April 12, three ICC members received the ICC Achievement Award in recognition of their exceptional contributions to research and learning in the fields of computing.

Soner Önder, director of the ICC Center for Scalable Architectures and Systems and professor of computer science, was recognized for his research in next-generation architectures. Önder is principal investigator of three National Science Foundation (NSF) grants, and he has three NSF grant proposals under review.

Kevin Trewartha, a member of the ICC’s Center for Human-Centered Computing, was recognized for his interdisciplinary and collaborative research at the intersection of technology and human motor movement. Trewartha is an assistant professor with a dual appointment in the departments of Cognitive and Learning Sciences and Kinesiology and Integrative Physiology. He is co-principal investigator, with ICC member Shane Mueller, of a new, three-year, interdisciplinary and collaborative project funded by the National Institutes of Health.

Bo Chen, a member of the ICC’s Center for Cybersecurity and assistant professor of computer science, was recognized for his teaching and research in cybersecurity of mobile devices. Chen is the co-PI of two external grants on cybersecurity from the National Security Agency, and he has submitted numerous cybersecurity proposals to NSF, NSA, Microsoft and Google.

The ICC, founded in 2015, promotes collaborative, cross-disciplinary research and learning experiences in the areas of cyber-physical systems, cybersecurity, data sciences, human-centered computing and scalable architectures and systems. It provides faculty and students the opportunity to work across organizational boundaries to create an environment that mirrors contemporary technological innovation. Five research centers comprise the ICC. Visit the ICC website, contact the ICC at icc-contact@mtu.edu or 7-2518.