Category: Publications

Mari Buche Is Co-author of Article in ACM SIGMIS Database

Mari Buche

Mari Buche (DataS), School of Business and Economics associate dean and professor of management information systems, is co-author of the article, “He Said, She Said: Communication Theory of Identity and the Challenges Men Face in the Information Systems Workplace,” which was published in the August 2019 issue of the newsletter ACM SIGMIS Database: the DATABASE for Advances in Information Systems.

Co-authors of the article are Cynthia K. Riemenschneider, Baylor University, and Deb Armstrong, Florida State University.

Abstract: The preponderance of the academic research focused on diversity in the IS field has emphasized the perspectives of women and racioethnic minorities. Recent research has found that following the appointment of a female CEO, white male top managers provided less help to colleagues, particularly those identified as minority-status (McDonald, Keeves, & Westphal, 2018). Additionally, Collison and Hearn (1994) assert that white men’s universal status and their occupancy of the normative standard state have rendered them invisible as objects of analysis. To develop a more holistic view of the IS workplace, we expand the academic exploration by looking at the challenges men face in the Information Systems (IS) workplace. Using a cognitive lens, we evoke the challenges men perceive they face at work and cast them into revealed causal maps. We then repeat the process evoking women’s perspectives of men’s challenges. The findings are analyzed using the Communication Theory of Identity (CTI) to determine the areas of overlap and identity gaps. This study advances our understanding of the cognitive overlap (and lack thereof) regarding the challenges facing men in the IS field, and provides another step toward developing a more inclusive IS work environment.

ACM SIGMIS Database: the DATABASE for Advances in Information Systems
Volume 50 Issue 3, August 2019
Pages 85-115
ACM New York, NY, USA

DOI: 10.1145/3353401.3353407

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.

MTU Digital Commons link:

ACM link:

Zhenlin Wang is Co-Author of Article in Parallel Programming Journal

Zhenlin Wang (SAS), professor of computer science, is co-author of the article, “Lightweight and accurate memory allocation in key-value cache,” published in the June 2019 issue of the International Journal of Parallel Programming, which is published by Springer.

Abstract: The use of key-value caches in modern web servers is becoming more and more ubiquitous. Representatively, Memcached as a widely used key-value cache system, originally intended for speeding up dynamic web applications by alleviating database load. One of the key factors affecting the performance of Memcached is the memory allocation among different item classes. How to obtain the most efficient partitioning scheme with low time and space consumption is a focus of attention. In this paper, we propose a lightweight and accurate memory allocation scheme in Memcached, by sampling access patterns, analyzing data locality, and reassigning the memory space. One early study on optimizing memory allocation is LAMA, which uses footprint-based MRC to optimize memory allocation in Memcached. However, LAMA does not model deletion operations in Memcached and its spatial overhead is quite large. We propose a method that consumes only 3% of LAMA space and can handle read, write and deletion operations. Moreover, evaluation results show that the average stable-state miss ratio is reduced by 15.0% and the average stable-state response time is reduced by 12.3% when comparing our method to LAMA.

Citation: Pan, C., Zhou, L., Luo, Y., Wang, X., & Wang, Z. (2019). Lightweight and accurate memory allocation in key-value cache. International Journal of Parallel Programming, 47(3), 451-466.

Digital Commons link:

Springer link: