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

Joep Aerts

dblp:31/3248 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
0since 2021 · last 2003
—ORCID · none

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

Systems, architecture and hardware · 3 · 2 first-authorTheory of computation · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 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
2 papers
Storage systems · 86% Cloud and datacenter computing · 14%
Computer graphics and multimedia
1 paper
Multimedia systems and quality of experience · 100%
Theoretical computer science
1 paper
Computational complexity · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems
data redundancy
0.012003
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems · IEEE Trans. Computers 2003
Storage systems › data management
data retrieval
0.012003
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems · IEEE Trans. Computers 2003
Storage systems
disk array
0.012003
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems · IEEE Trans. Computers 2003
Storage systems › i/o scheduling
disk scheduling
0.012003
On the Guaranteed Throughput of Multizone Disks · IEEE Trans. Computers 2003
Storage systems › magnetic storage
disk storage
0.012003
On the Guaranteed Throughput of Multizone Disks · IEEE Trans. Computers 2003
Storage systems › i/o scheduling › disk scheduling
SCAN scheduling
0.012003
On the Guaranteed Throughput of Multizone Disks · IEEE Trans. Computers 2003
Cloud and datacenter computing › quality of service
throughput guarantee
0.012003
On the Guaranteed Throughput of Multizone Disks · IEEE Trans. Computers 2003
Multimedia systems and quality of experience
multimedia streaming
0.012003
On the Guaranteed Throughput of Multizone Disks · IEEE Trans. Computers 2003
Computational complexity › constraint satisfaction
complexity classification
0.012003
Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems · IEEE Trans. Computers 2003

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

graph optimization · 0.1complexity analysis · 0.1
YearPublicationVenuePosition
2003 Approximation of a Retrieval Problem for Parallel Disks
Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma
CIAC1
2003 Random Redundant Storage in Disk Arrays: Complexity of Retrieval Problems
abstract
Random redundant data storage strategies have proven to be a good choice for efficient data storage in multimedia servers. These strategies lead to a retrieval problem in which it is decided for each requested data block which disk to use for its retrieval. In this paper, we give a complexity classification of retrieval problems for random redundant storage.
Joep Aerts, Jan H. M. Korst, Frits C. R. Spieksma, Wim F. J. Verhaegh, Gerhard J. Woeginger
IEEE Trans. Computers1
2003 On the Guaranteed Throughput of Multizone Disks
abstract
We derive the guaranteed throughput of a multizone disk that repeatedly handles batches of n requests of constant size. Using this guaranteed throughput in the design of multimedia systems, one can admit more streams or get smaller buffer requirements and guaranteed response times than when an existing lower bound is used. We consider the case that nothing can be assumed about the location of the requests on the disk. Furthermore, we assume that successive batches are handled one after the other, where the n requests in a batch are retrieved using a SCAN-based sweep strategy. We show that we only have to consider two successive batches to determine the guaranteed throughput. Using this, we can compute the guaranteed throughput by determining a maximum-weighted path in a directed acyclic graph in O(z/sub max//sup 3/n/sup 2/) time, where z/sub max/ is the number of zones of the disk.
Wil Michiels, Jan H. M. Korst, Joep Aerts
IEEE Trans. Computers3
2000 Random duplicate storage strategies for load balancing in multimedia servers
Joep Aerts, Jan H. M. Korst, Sebastian Egner
Inf. Process. Lett.1
1998 Scan chain design for test time reduction in core-based ICs
abstract
The size of the test vector set forms a significant factor in the overall production costs of ICs, as it defines the test application time and the required pin memory size of the test equipment. Large core-based ICs often require a very large test vector set for a high test coverage. This paper deals with the design of scan chains as transport mechanism for test patterns from IC pins to embedded cores and vice versa. The number of pins available to accommodate scan test is given, as well as the number of scan test patterns and scannable flip flops of each core. We present and analyze three scan chain architectures for core-based ICs, which aim at a minimum test vector set size. We give experimental results of the three architectures for an industrial IC. Furthermore we analyze the test time consequences of reusing cores with fixed internal scan chains in multiple ICs with varying design parameters.
Joep Aerts, Erik Jan Marinissen
ITC1