Author image not provided
 Abdullah Muzahid

Add personal information
  Affiliation history
Bibliometrics: publication history
Average citations per article6.18
Citation Count68
Publication count11
Publication years2009-2017
Available for download7
Average downloads per article243.57
Downloads (cumulative)1,705
Downloads (12 Months)486
Downloads (6 Weeks)27
Arrow RightAuthor only

See all colleagues of this author

See all subject areas


11 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 11 of 11
Sort by:

1 published by ACM
April 2017 EuroSys '17: Proceedings of the Twelfth European Conference on Computer Systems
Publisher: ACM
Citation Count: 1
Downloads (6 Weeks): 14,   Downloads (12 Months): 262,   Downloads (Overall): 262

Full text available: PDFPDF
Despite the obvious importance, performance issues related to synchronization primitives are still lacking adequate attention. No literature extensively investigates categories, root causes, and fixing strategies of such performance issues. Existing work primarily focuses on one type of problems, while ignoring other important categories. Moreover, they leave the burden of identifying ...

2 published by ACM
December 2016 ACM Transactions on Architecture and Code Optimization (TACO): Volume 13 Issue 4, December 2016
Publisher: ACM
Citation Count: 0
Downloads (6 Weeks): 5,   Downloads (12 Months): 74,   Downloads (Overall): 91

Full text available: PDFPDF
Parallel programming introduces notoriously difficult bugs, usually referred to as concurrency bugs. This article investigates the potential for deviating from the conventional wisdom of writing concurrency bug--free, parallel programs. It explores the benefit of accepting buggy but approximately correct parallel programs by leveraging the inherent tolerance of emerging parallel applications ...
Keywords: Concurrency bugs, algorithmic noise tolerance

June 2016 ISCA '16: Proceedings of the 43rd International Symposium on Computer Architecture
Publisher: IEEE Press
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 66,   Downloads (Overall): 77

Full text available: PDFPDF
Software failure diagnosis techniques work either by sampling some events at production-run time or by using some bug detection algorithms. Some of the techniques require the failure to be reproduced multiple times. The ones that do not require such, are not adaptive enough when the execution platform, environment or code ...
Keywords: sequential bugs, concurrency bugs, dependence, neural hardware, failures
Also published in:
October 2016  ACM SIGARCH Computer Architecture News - ISCA'16: Volume 44 Issue 3, June 2016

November 2015 CLOUDCOM '15: Proceedings of the 2015 IEEE 7th International Conference on Cloud Computing Technology and Science (CloudCom)
Publisher: IEEE Computer Society
Citation Count: 0

As cloud becomes a cost effective computing platform, improving its utilization becomes a critical issue. Determining an incoming application's sensitivity toward various resources is one of the major challenges to obtain higher utilization. To this end, previous research attempts to characterize an incoming application's sensitivity toward interference on various resources ...

October 2015 ICCD '15: Proceedings of the 2015 33rd IEEE International Conference on Computer Design (ICCD)
Publisher: IEEE Computer Society
Citation Count: 0

Performance bugs cannot be easily debugged in the same way correctness bugs are debugged. They are debugged mostly by analyzing execution profiles which is slow, tedious, and heavily involved. As a result, even for a mature program, performance bugs often slip into production systems. This paper presents a hardware based ...

August 2015 HPCC-CSS-ICESS '15: Proceedings of the 2015 IEEE 17th International Conference on High Performance Computing and Communications, 2015 IEEE 7th International Symposium on Cyberspace Safety and Security, and 2015 IEEE 12th International Conf on Embedded Software and Systems
Publisher: IEEE Computer Society
Citation Count: 0

Embedded applications are increasingly offloading their computations to a cloud data center. Determining an incoming application's sensitivity toward various shared resources is a major challenge. To this end, previous research attempts to characterize an incoming application's sensitivity toward interference on various resources (Source of Interference or SoI, for short) of ...
Keywords: Application characterization, data center, locality sensitive hashing

7 published by ACM
June 2013 ISCA '13: Proceedings of the 40th Annual International Symposium on Computer Architecture
Publisher: ACM
Citation Count: 9
Downloads (6 Weeks): 1,   Downloads (12 Months): 23,   Downloads (Overall): 279

Full text available: PDFPDF
Although fences are designed for low-overhead concurrency coordination, they can be expensive in current machines. If fences were largely free, faster fine-grained concurrent algorithms could be devised, and compilers could guarantee Sequential Consistency (SC) at little cost. In this paper, we present WeeFence (or WFence for short), a fence that ...
Keywords: sequential consistency, fences, memory consistency, parallel programming, shared-memory multiprocessors, synchronization
Also published in:
June 2013  ACM SIGARCH Computer Architecture News - ICSA '13: Volume 41 Issue 3, June 2013

December 2012 MICRO-45: Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture
Publisher: IEEE Computer Society
Citation Count: 10
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Downloads (Overall): 68

Full text available: PDFPDF
Past work has focused on detecting data races as proxies for Sequential Consistency (SC) violations. However, most data races do not violate SC. In addition, lock-free data structures and synchronization libraries sometimes explicitly employ data races but rely on SC semantics for correctness. Consequently, to uncover SC violations, we need ...
Keywords: Parallel program, Memory model, Sequential consistency violation, Bug

February 2012 HPCA '12: Proceedings of the 2012 IEEE 18th International Symposium on High-Performance Computer Architecture
Publisher: IEEE Computer Society
Citation Count: 3

Data races are a major contributor to parallel software unreliability. A type of race that is both common and typically harmful is the Asymmetric data race. It occurs when at least one of the racing threads is inside a critical section. Current proposals that target them are software-based. They slow ...

December 2010 MICRO '43: Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
Publisher: IEEE Computer Society
Citation Count: 13
Downloads (6 Weeks): 2,   Downloads (12 Months): 21,   Downloads (Overall): 193

Full text available: PDFPDF
A particularly insidious type of concurrency bug is atomicity violations. While there has been substantial work on automatic detection of atomicity violations, each existing technique has focused on a certain type of atomic region. To address this limitation, this paper presents Atom Tracker, a comprehensive approach to atomic region inference ...
Keywords: Concurrency Bug, Atomic Region, Atomicity Violation, Hardware, Signature

11 published by ACM
June 2009 ISCA '09: Proceedings of the 36th annual international symposium on Computer architecture
Publisher: ACM
Citation Count: 32
Downloads (6 Weeks): 2,   Downloads (12 Months): 29,   Downloads (Overall): 735

Full text available: PDFPDF
Detecting data races in parallel programs is important for both software development and production-run diagnosis. Recently, there have been several proposals for hardware-assisted data race detection. Such proposals typically modify the L1 cache and cache coherence protocol messages, and largely lose their capability when lines get displaced or invalidated from ...
Keywords: happened-before, timestamp, data race, SigRace, concurrency defect, signature
Also published in:
June 2009  ACM SIGARCH Computer Architecture News: Volume 37 Issue 3, June 2009

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us