MétaCan
Menu
Back to cohort
Record W4234190264 · doi:10.1002/cpe.1561

Special Issue: Advances in High‐Performance Computing and Communications

2010· article· en· W4234190264 on OpenAlexaff
Geyong Min, Keqiu Li, Laurence T. Yang

Bibliographic record

VenueConcurrency and Computation Practice and Experience · 2010
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsSt. Francis Xavier University
Fundersnot available
KeywordsComputer scienceScalabilityServerSupercomputerSet (abstract data type)Data scienceDistributed computingWorld Wide WebOperating system

Abstract

fetched live from OpenAlex

High-performance computing and communications has been an important and fundamental research topic over the past decade and has posed many challenging problems. Researchers and industrial professionals have been devoted to designing innovative tools and techniques to keep up with the rapid evolution and increasing complexity of large and complex scientific and engineering problems. This special issue contains seven extended and revised papers which were mainly selected from the 10th IEEE International Conference on High Performance Computing and Communications (HPCC-08) in Dalian, China, September 25–27, 2008. The purpose of the conference was to provide a forum for engineers and scientists in academia and industry to present and discuss their novel ideas, new research results, applications, experiences, work-in-progress, and state-of-the-art techniques in the area of high-performance computing and communications. The extended versions of these papers were carefully peer-reviewed according to the practice of this journal. The selected papers deal with a wide range of important aspects and challenging issues of high-performance computing and networking systems and the contents are built on analytical modeling, experimental and simulation studies. The contributions of these papers are outlined below. Dispatching a large number of jobs directly to a small number of physical servers requires much runtime information and computation in order to make the distributed computing system efficient and scalable. Choi et al. 1 presented a two-level indirect dispatching framework that dispatches requests to servers through virtual machines (VMs), called Dispatching Requests Indirectly through Virtual Environment (DRIVE). They set up an experimental environment consisting of a personal computer (PC) cluster and four benchmark suites to demonstrate the effectiveness of the DRIVE framework. The experimental results have shown that the use of VMs indeed abstracts away the client requests and hence helps to improve the overall performance of a dynamically changing computing environment. Virtualization is being widely deployed now as an emerging trend. Liao et al. 2 proposed a Lightweight Virtual Desktop (LVD) management architecture to combine the virtualization technology and inexpensive PCs. They implemented LVD in the cluster with VMs and compared the performance of LVD prototype system with those of the currently used desktop systems, including Microsoft Remote Desktop, Citrix MetaFrameXP and Sun Ray. The experimental results have shown that the LVD performs well in its functions improving the response time while decreasing the power consumptions. The workload characteristics and resource usage patterns of available applications are critical for the design and development of hardware and software stacks of future machines. Seelam et al. 3 presented a comprehensive workload performance characterization of three large-scale applications, i.e. Hybrid Coordinate Ocean Model, Parallel Ocean Program, and Lattice Boltzemann Magneto-Hydrodynamics Code, using timers and performance counters available on Power5+ chip. On the basis of the experimental results, they have described the sources of load imbalances in the applications and identified the potential impediments to the scalability of the applications under large processor counts. Communication through relay channels has received considerable research interests due to their ability of creating diversity and consequently improving the robustness of data transmission for ubiquitous computing and networking applications. Zhang et al. 4 presented the theoretical model and the implementation of two relaying algorithms, dynamic relaying and fixed relaying, in wireless sensor networks (WSNs) with a couple of relay nodes and investigated the performance of relay channels in terms of diversity gain and throughput. The experimental results have shown that the data throughput between the source node and the destination node is enhanced by the presence of the relay nodes. Moreover, the results have revealed the performance trade-offs between diversity and energy efficiency. Multipath routing protocols can potentially enhance the network robustness significantly to repudiation attacks. Yin et al. 5 proposed a novel Secure Multipath Routing Protocol with authentication mechanism for Mobile Ad hoc Networks (MANETs) to extensively defense the various attacks. Extensive analysis and experiments have demonstrated that the proposed schemes can effectively secure MANETs, yet incur very low communication and computation overhead. Attacks and defense are prevalent in the current Internet. The modeling of Internet traffic has been a critical task in the design of network architectures. Xiang et al. 6 presented a microscopic competition model to analyze the dynamics among the nodes, i.e. benign or malicious. The NS2 simulation results have proven that the model can well describe the competition behavior among normal users and attackers. According to this model, they proposed an anomaly attack detection method based on the Adaptive Reasons Theory (ART) neural network. The experiments have shown that the proposed model can effectively detect Distributed Denial of Service attacks. Target tracking is typically a thought-provoking application in WSNs. Wang et al. 7 proposed a two-level Cooperative and Energy-efficient Tracking (CET) algorithm that reduces energy consumption by requiring only a minimum number of sensor nodes to participate in communication, transaction and perform sensing for target tracking in WSNs. Performance analysis and simulation studies have demonstrated that CET improves target capturing speed and outperforms some existing protocols of target tracking with energy saving under certain ideal situations. We express our deep thanks to the Editor-in-Chief, Professor Geoffrey Fox, for providing us with the opportunity to host this special issue in Concurrency and Computation: Practice and Experience. We also thank the authors for their contributions, including those whose papers were not included. Last but not least, we thank the thoughtful work of the many reviewers who provided invaluable evaluations and recommendations.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Editorial · Consensus signal: Editorial
Teacher disagreement score0.080
Threshold uncertainty score0.267

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.007
Meta-epidemiology (narrow)0.0040.001
Meta-epidemiology (broad)0.0050.002
Bibliometrics0.0050.004
Science and technology studies0.0020.001
Scholarly communication0.0100.006
Open science0.0040.002
Research integrity0.0050.007
Insufficient payload (model declined to judge)0.0800.040

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.017
GPT teacher head0.331
Teacher spread0.314 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
Domainnot available
GenreEditorial

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueConcurrency and Computation Practice and ExperienceSame topicDistributed and Parallel Computing SystemsFrench-language works237,207