Sameer M. Bataineh

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from VLDB 2026 / reviewers in the wild / expert

dblp:54/1045 · DBLP profile ↗

← Back

6ranked-venue papers

6as first author

0since 2021 · last 2005

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3 · 3 first-authorComputer networks · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems

1 paper

Parallel and multicore computing · 87% Interconnection networks and networks-on-chip · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Parallel and multicore computing › parallel scheduling divisible load scheduling	1	1994	Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job · IEEE Trans. Computers 1994
Parallel and multicore computing load balancing	1	1994	Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job · IEEE Trans. Computers 1994
Interconnection networks and networks-on-chip network topology	1	1994	Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job · IEEE Trans. Computers 1994

Methods — techniques the papers use, named apart from their topics

equivalent processor aggregation · 0.0closed-form solution · 0.0

Year	Publication	Venue	Position
2005	Toward an analytical solution to task allocation, processor assignment, and performance evaluation of network processors Sameer M. Bataineh	J. Parallel Distributed Comput.	1
2003	Reliable Omega Interconnected Network for Large-Scale Multiprocessor Systems abstract The omega network has various attractive topological properties. It supports both one-to-one message routing and broadcast routing. Independent of the system size, every node in the network has a fixed size; therefore, it is used intensively in large-sized systems. In this paper, we examine a reliable omega-based multiprocessor system that preserves its full rigid omega configuration even in the presence of faults. The proposed omega interconnection network can tolerate any single and many multiple node failures, giving rise to significantly improved reliability. Reconfiguration in response to a single or multiple faults in the new design is easy and may be performed in a distributed manner. Unlike the reliable butterfly network, in the proposed reliable omega network, if a node at stage zero fails, the system will not lose a connection to one of its input/output ports. Reliability results show that our design compares favorably with an earlier one. Sameer M. Bataineh, Ghassan E. Qanzu'a	Comput. J.	1
1994	Effect of fault tolerance and communication delay on response time in a multiprocessor system with a bus topology Sameer M. Bataineh, Mohammad Al-Ibrahim	Comput. Commun.	1
1994	Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job abstract Optimal load allocation for load sharing a divisible job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum finish time and the optimal data allocation for each processor are obtained. The performance of large symmetric tree networks is examined by aggregating the component links and processors into a single equivalent processor. This allows an easy examination of large tree networks. In addition, it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time.> Sameer M. Bataineh, Te-Yu Hsiung, Thomas G. Robertazzi	IEEE Trans. Computers	1
1993	Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing A Divisible Job abstract Optimal load allocation for load sharing a divisi ble job over processors interconnected in either a bus or a tree network is considered. The processors are either equipped with front-end processors or not so equipped. Closed form solutions for the minimum fin ish time and the optimal data allocation for each pro cessor are obtained. The performance of large sym metric tree networks is examined by aggregating the component links and processors into a single equiv alent processor. This allows an easy examination of large tree networks. In addition it becomes possible to find a closed form solution for the optimal amount of data that is to be assigned to each processor in the tree network in order to achieve the minimum finish time. Sameer M. Bataineh, Te-Yu Hsiung, Thomas G. Robertazzi	ICPP (1)	1
1991	Bus-oriented load sharing for a network of sensor driven processors abstract A load-sharing problem involving the optimal allocation of measurement data among n sensor-driven processors interconnected through a bus-type communication medium is considered for three distinct architectural configurations. It is found that a minimal-time solution can be achieved if the computations by the processors end simultaneously. Simple recursions for the determination of the optimal allocation of load are presented. It is shown that for this problem a small number of processors can be almost as effective as a larger number.> Sameer M. Bataineh, Thomas G. Robertazzi	IEEE Trans. Syst. Man Cybern.	1