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

Jirada Kuntraruk

dblp:16/6062 · DBLP profile ↗
← Back
2ranked-venue papers
2as 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 · 2 · 2 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
Parallel and multicore computing · 57% Performance modeling and evaluation · 27% Cloud and datacenter computing · 8%
Databases, data mining, and information retrieval
1 paper
Data mining · 77% Information retrieval · 23%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel programming models
0.112005
Application Resource Requirement Estimation in a Parallel-Pipeline Model of Execution · IEEE Trans. Parallel Distributed Syst. 2005
Performance modeling and evaluation › capacity planning
resource requirement estimation
0.112005
Application Resource Requirement Estimation in a Parallel-Pipeline Model of Execution · IEEE Trans. Parallel Distributed Syst. 2005
Data mining › dimensionality reduction
feature extraction
0.012001
Massively Parallel Distributed Feature Extraction in Textual Data Mining Using HDDI(tm) · HPDC 2001
Parallel and multicore computing › parallel architecture
massively parallel processing
0.012001
Massively Parallel Distributed Feature Extraction in Textual Data Mining Using HDDI(tm) · HPDC 2001
Parallel and multicore computing
pipeline parallelism
0.012001
Massively Parallel Distributed Feature Extraction in Textual Data Mining Using HDDI(tm) · HPDC 2001
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.012005
Application Resource Requirement Estimation in a Parallel-Pipeline Model of Execution · IEEE Trans. Parallel Distributed Syst. 2005
Electronic design automation › high-level synthesis
scheduling
0.012005
Application Resource Requirement Estimation in a Parallel-Pipeline Model of Execution · IEEE Trans. Parallel Distributed Syst. 2005

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

hierarchical distributed dynamic indexing · 0.1speedup analysis · 0.1performance model · 0.1
YearPublicationVenuePosition
2005 Application Resource Requirement Estimation in a Parallel-Pipeline Model of Execution
abstract
We propose a massively parallel framework termed a parallel-pipeline model of execution that can be employed on a homogeneous computational cluster. We show that speedups near-linear in the number of processors are achievable for applications involving reduction operations based on a novel, parallel-pipeline model of execution. As computational clusters become viable alternative platforms for solving large computational problems, the research community acknowledges that the cluster environment can be used effectively when adaptive resource management is employed. This requires the ability to estimate the resource requirements of applications before scheduling decisions are made. We propose a resource estimation model for applications executed in the parallel-pipeline model of execution. We develop a performance model that predicts the resource utilization (i.e., computation and communication complexity) for applications executing under the parallel-pipeline model on a homogeneous computational cluster. This performance prediction model can provide information to a cluster scheduler.
Jirada Kuntraruk, William M. Pottenger, Andrew M. Ross
IEEE Trans. Parallel Distributed Syst.1
2001 Massively Parallel Distributed Feature Extraction in Textual Data Mining Using HDDI(tm)
abstract
One of the primary tasks in mining distributed textual data is feature extraction. The widespread digitization of information has created a wealth of data that requires novel approaches to feature extraction in a distributed environment. We propose a massively parallel model for feature extraction that employs unused cycles on networks of PCs/workstations in a highly distributed environment. We have developed an analytical model of the time and communication complexity of the feature extraction process in this environment based on feature extraction algorithms developed in our textual data mining research with HDDI/sup TM/ (Hierarchical Distributed Dynamic Indexing). We show that speedups linear in the number of processors are achievable for applications involving reduction operations based on a novel, parallel pipelined model of execution. We are in the process of validating our analytical model with empirical observations based on the extraction of features from a large number of pages on the World Wide Web.
Jirada Kuntraruk, William M. Pottenger
HPDC1