Bassam Z. Kahhaleh's research while affiliated with University of Jordan and other places
What is this page?
This page lists the scientific contributions of an author, who either does not have a ResearchGate profile, or has not yet added these contributions to their profile.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
It was automatically created by ResearchGate to create a record of this author's body of work. We create such pages to advance our goal of creating and maintaining the most comprehensive scientific repository possible. In doing so, we process publicly available (personal) data relating to the author as a member of the scientific community.
If you're a ResearchGate member, you can follow this page to keep up with this author's work.
If you are this author, and you don't want us to display this page anymore, please let us know.
Publications (3)
The general k-terminal reliability problem for undirected graph
models is considered. An algorithm, named MBA, is developed that uses
the approximation approach. It utilizes Monte Carlo simulation, together
with breadth-first search, to find the reliability. After a sufficient
number of simulations, an accurate reliability estimate is found in
feas...
The Kendall Square Research KSR1 MPP system has a shared address space, which spreads over physically distributed memory modules. Thus, memory access time can vary over a wide range even when accessing the same variable, depending on how this variable is being referenced and updated by the various processors. Since the processor stalls during this...
The KSRI has a shared address space, which spreads over physically
distributed memory modules with various latencies. Thus performance
depends considerably on the program's locality of reference and the
effectiveness of using prefetch and post-store instructions. This paper
analyzes the various memory latency factors which stall the processor
durin...
Citations
... Traditional network reliability methods include exact NP-hard methods [1,8,9,24] or approximated methods. Among approximated methods, there are several methods such as graph reduction [1,9], cut-set and tie-set approximations [1], Monte Carlo (MC) [25][26][27][28][29], and bounds [1,30,31]. More recently, modern approaches based on percolation theory [32], All-Pairs Homogeneity-Arc [33], matrix-exponential [34], minimal cuts for demand (d-MC) [35], binary-addition tree [36,37], among others, have been applied for network reliability as well. ...
... The performance of the KSR1 system has been analyzed by Dunigan [14], Windheiser et al [13], Kahhaleh [17], and Rosti et al [15]. ...
