检索结果-内蒙古大学图书馆

International Conference on Advanced Information Networking and Applications (AINA)

作者： Chao-Tung Yang Kuan-Wei Cheng Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

In this paper, a parallel loop self-scheduling scheme for heterogeneous PC cluster systems is proposed. Though the proposed scheme does allow users to choose parameters before the execution initialization phase, there are still weaknesses that motivate us to go further with new improvements in that scheme. For instance, a decision on a fixed and monotonous parameter can easily lead to invalid schedule by using previous input information. Thus, it is proposed in this paper a new scheme, where the scheduling parameter can be adjusted dynamically and fit into most widely available computer systems, in order to provide higher overall performance.

关键词： Processor scheduling Dynamic scheduling Load management Master-slave Concurrent computing distributed computing Clustering algorithms Runtime Computer science Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

On implementation of an enhanced and integrated parallel programming Web-based toolkit

On implementation of an enhanced and integrated parallel pro...

引用

International Conference on Information Technology: Research and Education (ITRE)

作者： Kuan-Ching Li Chao-Tung Yang Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan High Performance Computing Laboratory Department of Computer Science and Infnmation Engineering Tunghai University Taichung Taiwan

ISBN: (纸本)0780389328

The computing power provided by high performance and low cost PC-based clusters and grid computing platforms are attractive and they are equal or superior to supercomputers and mainframes. In parallel, discussions on how to obtain more computing power from these computing platforms become an interesting issue. The development of applications for these high-performance computing platforms is complicated for several reasons: the complexity of applications themselves, which combines aspects of super computing and distributed computing, and by the need to achieve higher performance. This paper describes the design rationale and implementation of a parallel programming Web-based toolkit, to ease the parallel programming learning process, with the use of Web-based interface. The toolkit has widely been used in MPI parallel programming courses (both in graduate and undergraduate levels) and industry trainings.

关键词： parallel programming Concurrent computing Application software distributed computing Grid computing High performance computing Visualization Computer science Supercomputers Industrial training

来源：评论

学校读者我要写书评

暂无评论

RAFlow: Read Ahead Accelerated I/O Flow through Multiple Virtual Layers

RAFlow: Read Ahead Accelerated I/O Flow through Multiple Vir...

引用

International Conference on Networking, Architecture, and Storage (NAS)

作者： Zhaoning Zhang Kui Wu Huiba Li Jinghua Feng Yuxing Peng Xicheng Lu National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology China Computer Science Department University of Victoria B.C. Canada National Super Computing Center Tianjin China

Virtualization is the foundation for cloud computing, and the virtualization can not be achieved without software defined, elastic, flexible and scalable virtual layers. Unfortunately, if multiple virtual storage devices are chained together, the system may be subject to severe performance degradation. While the read-ahead (RA) mechanism in storage devices plays a very important role to improve I/O performance, RA may not be effective as expected for multiple virtualization layers, since it is originally designed for one layer only. When I/O requests are passed through a long I/O path, they may trigger a chain reaction and lead to unnecessary data transmission and thus bandwidth waste. In this paper, we study the dynamic behavior of RA through multiple I/O layers and demonstrate that if controlled well, RA can greatly accelerate I/O speed. We present RAFlow, a RA control mechanism, to effectively improve I/O performance by strategically expanding RA window at each layer. Our real-world experiments show that it can achieve 20% to 50% performance improvement in I/O paths with up to 8 virtualized storage devices.

关键词： Radio access networks Acceleration distributed databases Performance evaluation Synchronization Benchmark testing Degradation

来源：评论

学校读者我要写书评

暂无评论

Decision tree construction for data mining on grid computing environments

Decision tree construction for data mining on grid computing...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Chao-Tung Yang Shu-Tzu Tsai Kuan-Ching Li High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0769522491

In this paper, the authors presented the grid-based decision tree architecture, with the intention of applying it to both parallel and sequential algorithms. Also, it is shown that, based on the scope and model of data mining applied in the grid environment as well as user equivalent perspective, grid roles can be categorized into three types. It was aimed, through these definitions, to help software developers define clear system processes and differentiate the application scope for software applications. To fulfill the architecture, an existing parallel decision tree algorithm was first applied (the SPRINT algorithm) to the grid environment. The performance and differences in many other areas are compared using datasets of different sizes. The experimental results will be used for future reference and further development.

关键词： Decision trees Data mining Grid computing Computer architecture Clustering algorithms Concurrent computing distributed computing Computer science Application software Chaos

来源：评论

学校读者我要写书评

暂无评论

The anatomy of a course in cluster and grid computing

The anatomy of a course in cluster and grid computing

引用

International Conference on Information Technology: Research and Education (ITRE)

作者： Chao-Tung Yang Kuan-Ching Li High Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Taichung Taiwan

ISBN: (纸本)0780389328

Cluster and grid computing is a relatively new interdisciplinary field, where computer science, engineering and computational biology are its core supporting disciplines. The rise of cluster and grid computing discipline brings to computer science faculty members new opportunities and challenges, both in education and in research. In this paper, we explore issues in teaching cluster and grid computing, the developing of curricula, and thoughts to foster student to work on research projects in cluster and grid computing.

关键词： Anatomy Grid computing distributed computing Concurrent computing Computer networks Brain modeling Predictive models Computer science Education Space technology

来源：评论

学校读者我要写书评

暂无评论

Research on the weighted reconstruction of metabolic networks

Research on the weighted reconstruction of metabolic network...

引用

第五届中国蛋白质组学大会暨首届粤港蛋白质组学学术交流会

作者： Zhou Tingting Wang Zhenghua Chan, K.C.C. Beijing Proteome Research Center BeijingP.R.China102206 National Laboratory for Parallel & Distributed ProcessingNational University of Deference and TechnologyChangshaP.R.China 410073 Department of computingthe HongKong Polytechnic UniversityHonghumHongkong Department of computing the HongKong Polytechnic UniversityHonghumHongkong National Laboratory for Parallel & Distributed Processing National University of Deference and TechnologyChangshaP.R.China 410073

来源：评论

学校读者我要写书评

暂无评论

EDDNet: An Efficient and Accurate Defect Detection Network for the Industrial Edge Environment

EDDNet: An Efficient and Accurate Defect Detection Network f...

引用

IEEE International Conference on Software Quality, Reliability and Security (QRS)

作者： Runbing Qin Ningjiang Chen Yihui Huang School of Computer and Electronic Information Guangxi University Nanning China Guangxi Intelligent Digital Services Research Center of Engineering Technology Nanning China Guangxi Colleges and Universities Key Laboratory of Parallel and Distributed Computing Nanning China

Defect detection aims to locate the accurate position of defects in images, which is of great significance to quality inspection in the industrial product manufacturing. Currently, many defect detection methods rely on deep neural networks to extract features. Although the accuracy of these methods is relatively high, it is computationally intensive, making the methods difficult to deploy in resource-limited edge devices. In order to solve these problems, a lightweight defect detection model for the industrial edge environment is proposed, termed the efficient defect detection network (EDDNet). EfficientNet-B0 is used as the feature extraction backbone, extracting feature maps from feature layers of different depths of the network and fusing multilevel features by multilevel feature fusion (MFF). To obtain more information, we redesign the attention mechanism in MBConv blocks, taking the encoding space (ES) attention mechanism as a new module, which solves the problem that the defective image spatial information is ignored. The experimental results on the NEU-DET and DAGM2007 datasets and PCB defect datasets demonstrate the effectiveness of the proposed EDDNet and its possibility for application in industrial edge device.

关键词： Image edge detection Computational modeling Neural networks Software quality Object detection Feature extraction Transformers

来源：评论

学校读者我要写书评

暂无评论

Let Robots Watch Grass Grow: Optimal Task Assignment for Automatic Plant Factory

IEEE Transactions on Sustainable Computing

引用

IEEE Transactions on Sustainable computing 2024年

作者： Xiang, Zhengzhe Xue, Xizi Chen, Yuanyi Dustdar, Schahram Guo, Minyi Hangzhou City University Hangzhou China Zhejiang University Hangzhou China Austria and part-time ICREA Research Professor at UPF Distributed Systems Group of TU Wien Barcelona Spain Shanghai Jiao Tong University Emerging Parallel Computing Center Shanghai China

Modularized plant factories, characterized by machines executing intelligent control requests to automatically take care of crops, have emerged as a sustainable agricultural paradigm, garnering the attention of Internet-of-Things and agricultural researchers for their production stability and energy efficiency. However, the diversity and pluralism of the plant factory components make it difficult to cooperate and produce crops with better qualities. Therefore, appropriate resource allocation and task scheduling strategies become the key points to optimize the quality of production in the factories by immediately telling which component is more suitable to do what in taking care of the crops. To address this challenge, this paper investigates how the machines of the factory can use their unique services and resource to help improve the crops' quality and model the machine cooperation as an online decision-making problem. An α-competitive approach called OnATS is designed based on the transformation of the original problem, and the experiments show that the proposed algorithm is superior to the baselines. Additionally, this paper explores the impact of different system configurations on the proposed method and shows that the proposed approach has broad applicability. © 2016 IEEE.

关键词： Plant Factory Resource Allocation Service Deployment Task Assignment

来源：评论

学校读者我要写书评

暂无评论

Fault-intolerance of reconfigurable systolic arrays

Fault-intolerance of reconfigurable systolic arrays

引用

International Symposium on Fault-Tolerant computing (FTCS)

作者： A. Nayak N. Santoro R. Tan Center for Parallel & Distributed Computing School of Computer Science Carleton University Ottawa Canada Istituto di Scienze dell Informasione Universite di Bari Bari Italy Department of Computer Sciences University of Utrecht Utrecht Netherlands

Identification, characterization, and construction of fault patterns that are catastrophic for linear systolic arrays are discussed. It is shown that for a given link configuration in the array, it is possible to identify all PE (processing element) catastrophic fault patterns. The requirement on the minimum number of faults in a fault pattern and its spectrum (spread out) for it to be catastrophic is shown to be a function of the length of the longest bypass link available, and not of the total number of bypass links. The paper also gives bounds on the width of a catastrophic fault spectrum.< >

关键词： Systolic arrays Circuit faults Redundancy Fault tolerance Computer science Fault diagnosis distributed computing Concurrent computing parallel processing Pipeline processing

来源：评论

学校读者我要写书评

暂无评论

An Efficient Label Routing on High-Radix Interconnection Networks

An Efficient Label Routing on High-Radix Interconnection Net...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Fei Lei Dezun Dong Xiangke Liao College of Computer National University of Defense Technology China National Laboratory for Parallel and Distributed Processing National University of Defense Technology China Collaborative Innovation Center of High Performance Computing National University of Defense Technology China

ISBN: (纸本)9781538632086

Cost-effective adaptive routing has a significant impact on overall performance for high-radix hierarchical topologies, such as Dragonfly, which achieve a lower network diameter than traditional topologies, Torus and Fat tree, but exhibit a lower degree of adaptiveness for shortest-path rout- ing. Existing adaptive routing methods for those hierarchical topologies improve the adaptiveness by increasing path length, i.e. local or global adaptive routing, and thus suffer from complex and costly deadlock avoidance. This work aims to maximize the routing adaptiveness at the minimum cost of deadlock avoidance. We propose a label routing method for high-radix hierarchical networks. This label routing utilizes a co-design methodology and coordinates the two pipelines, input queue and routing computation, in the router microarchitec- ture. Packets in the input buffer are labeled by our routing algorithm depending on network states. We reorganize the input buffer and develop a label routing algorithm, named Green-Red Routing, GRR. GRR relaxes the requirement of using virtual channels to eliminate routing deadlock, and mitigates buffer resources dedicated to deadlock avoidance. GRR manages the buffer resources and balance its utilization elaborately, and achieve fully adaptive routing efficiently. We conduct extensive experiments to evaluate the performance of GRR on Dragonfly and compare it with state-of-the-art works. The results show that GRR achieves 10%-35% higher performance than existing routing algorithms under most traffic patterns.

关键词： Routing System recovery Network topology Topology Resource management Adaptive systems Organizations

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：