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

Adnan Khaleel

dblp:44/5415 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
Storage systems · 70% Performance modeling and evaluation · 30%

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

TopicWeightPapersLastEvidence papers
Storage systems › network-attached storage
network-attached secure disk
0.012000
Performance Evaluation of Storage Systems Based on Network-Attached Disks · IEEE Trans. Parallel Distributed Syst. 2000
Storage systems
network-attached storage
0.012000
Performance Evaluation of Storage Systems Based on Network-Attached Disks · IEEE Trans. Parallel Distributed Syst. 2000
Performance modeling and evaluation › simulation › discrete-event simulation
trace-driven simulation
0.012000
Performance Evaluation of Storage Systems Based on Network-Attached Disks · IEEE Trans. Parallel Distributed Syst. 2000
Storage systems
distributed storage
0.012000
Performance Evaluation of Storage Systems Based on Network-Attached Disks · IEEE Trans. Parallel Distributed Syst. 2000

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

trace-driven simulation · 0.0
YearPublicationVenuePosition
2000 Performance Evaluation of Storage Systems Based on Network-Attached Disks
abstract
The emergence of network-attached disks provides the possibility of transferring data between the storage system and the client directly. This offers new possibilities in building a distributed storage system. In this paper, we examine different storage organizations based on network-attached disks and compare the performance of these systems to a traditional system. Trace-driven simulations are used to measure the average response times of the client requests in two different workloads. We show that the advantages of distributing the server's network processing load to disks can be offset by losses in cache hits in a system based on network-attached disks. The two workloads we considered highlight this impact. We show that it is possible to offload significant load from the server by utilizing network-attached disks and point out that specific applications may be able to better exploit the features of network-attached disks.
Gang Ma 0012, Adnan Khaleel, A. L. Narasimha Reddy
IEEE Trans. Parallel Distributed Syst.2
1999 Evaluation of Data and Request Distribution Policies in Clustered Servers
Adnan Khaleel, A. L. Narasimha Reddy
HiPC1