Fuad Abujarad
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fuad Abujarad has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Sandeep S. Kulkarni
Michigan State University, East Lansing, USA
6 shared publications - Borzoo Bonakdarpour
University of Waterloo
4 shared publications - Borzoo Bonakdarpour
VERIMAG
1 shared publication Kevin W. Harris
1 shared publication
Latest Publications
- 4 October 2011
- Published by Springer Nature in Distributed Computing
- Vol. 25 (1) , 83-108
Symbolic synthesis of masking fault-tolerant distributed programs
- 4 October 2011
- Published by Springer Nature in Distributed Computing
- Vol. 25 (1) , 83-108
Symbolic synthesis of masking fault-tolerant distributed programs
- Open Access
- 15 December 2009
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 14 (14) , 92-106
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
Previous work has shown that there are two major complexity barriers in the synthesis of faulttolerant distributed programs: (1) generation of fault-span, the set of states reachable in the presence of faults, and (2) resolving deadlock states, from where the program has no outgoing transitions. Of these, the former closely resembles with model checking and, hence, techniques for efficient verification are directly applicable to it. Hence, we focus on expediting the latter with the use of multi-core technology. We present two approaches for parallelization by considering different design choices. The first approach is based on the computation of equivalence classes of program transitions (called group computation) that are needed due to the issue of distribution (i.e., inability of processes to atomically read and write all program variables). We show that in most cases the speedup of this approach is close to the ideal speedup and in some cases it is superlinear. The second approach uses traditional technique of partitioning deadlock states among multiple threads. However, our experiments show that the speedup for this approach is small. Consequently, our analysis demonstrates that a simple approach of parallelizing the group computation is likely to be the effective method for using multicore computing in the context of deadlock resolution.
- 15 December 2009
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 14 (14) , 92-106
Open AccessParallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
Previous work has shown that there are two major complexity barriers in the synthesis of faulttolerant distributed programs: (1) generation of fault-span, the set of states reachable in the presence of faults, and (2) resolving deadlock states, from where the program has no outgoing transitions. Of these, the former closely resembles with model checking and, hence, techniques for efficient verification are directly applicable to it. Hence, we focus on expediting the latter with the use of multi-core technology. We present two approaches for parallelization by considering different design choices. The first approach is based on the computation of equivalence classes of program transitions (called group computation) that are needed due to the issue of distribution (i.e., inability of processes to atomically read and write all program variables). We show that in most cases the speedup of this approach is close to the ideal speedup and in some cases it is superlinear. The second approach uses traditional technique of partitioning deadlock states among multiple threads. However, our experiments show that the speedup for this approach is small. Consequently, our analysis demonstrates that a simple approach of parallelizing the group computation is likely to be the effective method for using multicore computing in the context of deadlock resolution.
- Open Access
- 1 December 2009
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 258 (2) , 3-15
Weakest Invariant Generation for Automated Addition of Fault-Tolerance
- 1 December 2009
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 258 (2) , 3-15
Open AccessWeakest Invariant Generation for Automated Addition of Fault-Tolerance
- Open Access
- 1 April 2008
- Published by Defense Technical Information Center (DTIC)
Breast Cancer Microvesicles as a Novel Plasma Biomarker and Therapeutic Target (IDEA)
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states reachable in the presence of faults, and, resolving deadlock states, where the program has no outgoing transitions. Although symbolic techniques can improve the performance of synthesis algorithms by orders of magnitude, efficient heuristics are still needed to overcome the aforementioned obstacles. Thus, motivated by the idea of partitioning the transition relation of distributed programs across multiple threads, in this paper, we introduce an efficient parallel shared memory algorithm for resolving deadlock states in symbolic synthesis of distributed programs. In spite of notorious resistance of symbolic algorithms for parallelization, experimental results show that our parallel algorithm exhibits superlinear performance improvement.
- 1 April 2008
- Published by Defense Technical Information Center (DTIC)
Open AccessBreast Cancer Microvesicles as a Novel Plasma Biomarker and Therapeutic Target (IDEA)
Previous work has shown that there are two major complexity barriers in the synthesis of fault-tolerant distributed programs, namely generation of fault-span, the set of states reachable in the presence of faults, and, resolving deadlock states, where the program has no outgoing transitions. Although symbolic techniques can improve the performance of synthesis algorithms by orders of magnitude, efficient heuristics are still needed to overcome the aforementioned obstacles. Thus, motivated by the idea of partitioning the transition relation of distributed programs across multiple threads, in this paper, we introduce an efficient parallel shared memory algorithm for resolving deadlock states in symbolic synthesis of distributed programs. In spite of notorious resistance of symbolic algorithms for parallelization, experimental results show that our parallel algorithm exhibits superlinear performance improvement.
- Open Access
- 1 January 2008
- Published by Defense Technical Information Center (DTIC)
Parallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
The purpose of this project is to establish a research and training collaborative partnership between the Institute for Population Health Policy (IPHP) at the University of Texas-Pan American (UTPA) and the Leonard Davis Institute of Health Economics (LDI) at the University of Pennsylvania (Penn). Our objectives and scope are: to develop a competitive and successful breast cancer research program that focuses in cancer control and population sciences at UTPA; to develop and complete a research project on barriers to breast cancer screening among Latinas in the U.S.-Mexico border region; to develop the research infrastructure that will enable UTPA investigators to submit competitive breast cancer research proposals. The key accomplishments during the second year of the project are: the collection of most of the survey data on mammography screening practices; acceptance in a peer reviewed journal of a manuscript on health insurance coverage and mammography screening; and securing a federal grant to further develop health services research at UTPA in collaboration with Penn.
- 1 January 2008
- Published by Defense Technical Information Center (DTIC)
Open AccessParallelizing Deadlock Resolution in Symbolic Synthesis of Distributed Programs
The purpose of this project is to establish a research and training collaborative partnership between the Institute for Population Health Policy (IPHP) at the University of Texas-Pan American (UTPA) and the Leonard Davis Institute of Health Economics (LDI) at the University of Pennsylvania (Penn). Our objectives and scope are: to develop a competitive and successful breast cancer research program that focuses in cancer control and population sciences at UTPA; to develop and complete a research project on barriers to breast cancer screening among Latinas in the U.S.-Mexico border region; to develop the research infrastructure that will enable UTPA investigators to submit competitive breast cancer research proposals. The key accomplishments during the second year of the project are: the collection of most of the survey data on mammography screening practices; acceptance in a peer reviewed journal of a manuscript on health insurance coverage and mammography screening; and securing a federal grant to further develop health services research at UTPA in collaboration with Penn.
- Open Access
- 1 January 2008
- Published by Defense Technical Information Center (DTIC)
Using Model Checking Techniques for Symbolic Synthesis of Distributed Programs
This report to Congress, Measuring Stability and Security in Iraq, is submitted pursuant to Section 9010 of the Department of Defense Appropriations Act 2007, Public Law 109-289 as amended by Section 1308 of Public Law 110-28 and Section 1224 of Public Law 110-181 and Section 9204 of the Supplemental Appropriations Act for 2008, Public Law 110-252. The report includes specific performance indicators and measures of progress toward political, security, and economic stability in Iraq, as directed in that legislation. This is the thirteenth in a series of quarterly reports on this subject. The most recent report was submitted in June 2008. The report complements other reports and information about Iraq provided to Congress and is not intended as a single source of all information about the combined efforts or the future strategy of the United States, its Coalition partners, or Iraq.
- 1 January 2008
- Published by Defense Technical Information Center (DTIC)
Open AccessUsing Model Checking Techniques for Symbolic Synthesis of Distributed Programs
This report to Congress, Measuring Stability and Security in Iraq, is submitted pursuant to Section 9010 of the Department of Defense Appropriations Act 2007, Public Law 109-289 as amended by Section 1308 of Public Law 110-28 and Section 1224 of Public Law 110-181 and Section 9204 of the Supplemental Appropriations Act for 2008, Public Law 110-252. The report includes specific performance indicators and measures of progress toward political, security, and economic stability in Iraq, as directed in that legislation. This is the thirteenth in a series of quarterly reports on this subject. The most recent report was submitted in June 2008. The report complements other reports and information about Iraq provided to Congress and is not intended as a single source of all information about the combined efforts or the future strategy of the United States, its Coalition partners, or Iraq.