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

16th IEEE International Conference on Parallel and distributed Systems, ICPADS 2010

作者： Rahman, Mustafizur Ranjan, Rajiv Buyya, Rajkumar Cloud Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia Service Oriented Computing Research Group School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9780769543079

In this paper, we propose a taxonomy that characterizes and classifies different components of autonomic application management in Grids. We also survey several representative Grid systems developed by various projects world-wide to demonstrate the comprehensiveness of the taxonomy. The taxonomy not only highlights the similarities and differences of state-of-the-art technologies utilized in autonomic application management from the perspective of Grid computing, but also identifies the areas that require further research initiatives. © 2010 IEEE.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Dependable workflow scheduling in global grids

Dependable workflow scheduling in global grids

引用

2009 10th IEEE/ACM International Conference on Grid computing, Grid 2009

作者： Rahman, Mustafizur Ranjan, Rajiv Buyya, Rajkumar Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia Service Oriented Computing Research Group School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9781424451494

In this paper, a reputation-based Grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized Grid overlays. The proposed approach builds upon structured peer-to-peer indexing and overlay networking techniques to create a scalable wide-area networking of Grid sites for supporting dependable scheduling of applications. The scheduling algorithm considers reliability of a Grid resource as a statistical property, which is globally computed in the decentralized Grid overlay based on dynamic feedbacks or reputation scores assigned by individual service consumers (Grid Resource Brokers). The proposed algorithm can dynamically adapt to changing resource conditions and offer significant performance gains as compared to traditional approaches in the event of unsuccessful job execution or resource failure. We evaluate and demonstrate the feasibility of our approach through an extensive trace driven simulation. The results show that our scheduling technique can reduce the makespan up to 50% and successfully isolate the failure-prone resources from the system. © 2009 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Group-based coordinated checkpointing for MPI: A case study on infiniband

Group-based coordinated checkpointing for MPI: A case study ...

引用

36th International Conference on Parallel Processing in Xi'an, ICPP

作者： Gao, Qi Huang, Wei Koop, Matthew J. Panda, Dhabaleswar K. Network-Based Computing Laboratory Department of Computer Science and Engineering Ohio State University Columbus OH United States

ISBN: (纸本)076952933X

As more and more clusters with thousands of nodes are being deployed for high performance computing (HPC), fault tolerance in cluster environments has become a critical requirement. Checkpointing and rollback recovery is a common approach to achieve fault tolerance. Although widely adopted in practice, coordinated checkpointing has a known limitation on scalability. Severe contention for bandwidth to storage system can occur as a large number of processes take a checkpoint at the same time, resulting in an extremely long checkpointing delay for large parallel applications. In this paper, we propose a novel group-based checkpointing design to alleviate this scalability limitation. By carefully scheduling the MPI processes to take checkpoints in smaller groups, our design reduces the number of processes simultaneously taking checkpoints, while allowing those processes not taking checkpoints to proceed with computation. We implement our design and carry out a detailed evaluation with micro-benchmarks, HPL, and the parallel version of a data mining toolkit, MotifMiner. Experimental results show our group-based checkpointing design can reduce the effective delay for checkpointing significantly, up to 78% for HPL and up to 70% for MotifMiner. © 2007 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Some classes of complete permutation polynomials over Fq

引用

Science China Mathematics 2015年第10期58卷 2081-2094页

作者： WU GaoFei LI Nian HELLESETH Tor ZHANG YuQing State Key Laboratory of Integrated Service Networks Xidian University Information Security and National Computing Grid Laboratory Southwest Jiaotong University Department of Informatics University of Bergen National Computer Network Intrusion Protection Center University of Chinese Academy of Sciences

By using a powerful criterion for permutation polynomials, we give several classes of complete permutation polynomials over finite fields. First, two classes of complete permutation monomials whose exponents are of Niho type are presented. Second, for any odd prime p, we give a sufficient and necessary condition for a-1xdto be a complete permutation polynomial over Fp4 k, where d =(p4k-1)/(pk-1)+ 1 and a ∈ F*p4k. Finally, we present a class of complete permutation multinomials, which is a generalization of recent work.

关键词： finite field complete permutation polynomials Walsh transform Niho exponents Dickson polynomials

来源：评论

学校读者我要写书评

暂无评论

Source code fragment summarization with small-scale crowdsourcing based features

引用

Frontiers of Computer Science 2016年第3期10卷 504-517页

作者： Najam NAZAR He JIANG Guojun GAO Tao ZHANG Xiaochen LI Zhilei REN Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian 116621 China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China Department of Computing The Hong Kong Polytechnic University Hong Kong China

Recent studies have applied different approaches for summarizing software artifacts, and yet very few efforts have been made in summarizing the source code fragments available on web. This paper investigates the feasibility of generating code fragment summaries by using supervised learning algorithms. We hire a crowd of ten individuals from the same work place to extract source code features on a cor- pus of 127 code fragments retrieved from Eclipse and Net- Beans Official frequently asked questions （FAQs）. Human an- notators suggest summary lines. Our machine learning algo- rithms produce better results with the precision of 82% and perform statistically better than existing code fragment classi- fiers. Evaluation of algorithms on several statistical measures endorses our result. This result is promising when employing mechanisms such as data-driven crowd enlistment improve the efficacy of existing code fragment classifiers.

关键词： summarizing code fragments supervised learning crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

A polynomial-based pairwise key pre-distribution and node authentication protocol for WSNs

引用

Telkomnika (Telecommunication computing Electronics and Control) 2015年第4期13卷 1113-1120页

作者： Banaie, Fatemeh Seno, Seyed Amin Hosseini Aldmour, Ismat Budiarto, Rahmat Network Research Laboratory Department of Engineering Ferdowsi University of Mashhad Iran Smart Networked Computing Research Group College of Computer Science and Information Technology Al Baha University Saudi Arabia

Continuous advances in the areas of sensor networks have made wireless sensor networks (WSNs) attractive for a wide variety of applications, with vastly varying requirements and characteristics. As the data sensed by nodes usually contain sensitive information, adherence to data protection requirements is vital in *** paper introduces a new and robust key pre-distribution key management scheme using random polynomial functions and a matrix. The proposed mechanism significantly increases storage efficiency and enhances network resilience against node capture. The effectiveness of the mechanism is demonstrated by security analysis and comparisontothe existing schemes. © 2015 Universitas Ahmad Dahlan.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Achieving acceptable accuracy in a low-cost, assistive note-taking, speech transcription system

Achieving acceptable accuracy in a low-cost, assistive note-...

引用

4th IASTED International Conference on Telehealth and Assistive Technologies, Telehealth/AT 2008

作者： Way, Thomas Kheir, Richard Bevilacqua, Louis Department of Computing Sciences Applied Computing Technology Laboratory Villanova University 800 Lancaster Avenue Villanova PA 19085 United States Hughes Network Systems in Germantown MD United States

ISBN: (纸本)9780889867406

Recent advancements in speech recognition technology and the widespread availability of inexpensive computers mean that real-time transcription in the classroom is becoming practical. This paper reports on the accuracy and readability achieved using a low-cost speech transcription system that assists deaf and hard-of-hearing students with note-taking. The design is presented for a system that attempts to balance issues of availability and cost with usability and accuracy to provide a viable and fully automatic alternative to a human signer or note taker. While this study focuses on empirical measures of design choices and accuracy, anecdotal results are also presented, with particular attention paid to the practical trade-offs between cost, accuracy and readability of a real-time transcription system.

关键词： Transcription

来源：评论

学校读者我要写书评

暂无评论

PDRL-CM: An efficient cooperative caching management method for vehicular networks based on deep reinforcement learning

引用

Ad Hoc networks 2025年 176卷

作者： Ou, Pingjie Chen, Ningjiang Yang, Long School of Computer and Electronic Information Guangxi University Nanning Guangxi530004 China Key Laboratory of Parallel Distributed and Intelligent Computing Education Department of Guangxi Zhuang Autonomous Region Nanning Guangxi530004 China The Guangxi Intelligent Digital Services Research Center of Engineering Technology Nanning Guangxi530004 China

In vehicular networks, onboard devices face the challenge of limited storage, and computational resources constrain their processing and storage capabilities. This limitation is particularly significant for applications that require complex computations and real-time responses. Additionally, limited storage capacity reduces the range of cacheable data, which can impact the immediate availability of data and the continuity of services. Therefore, improving cache utilization and meeting vehicles’ real-time data demands pose significant challenges. Deep reinforcement learning can optimize the issues arising from agents’ continuously changing state and action spaces due to increasing request demands. However, training the network may encounter instability and convergence difficulties in dynamic and complex environments or situations with sparse rewards. In response to these issues, this paper proposes a Priority-based Deep Reinforcement Learning Collaborative Cache Management method (PDRL-CM). PDRL-CM first designs a lightweight cache admission strategy that leverages data's inherent and combined attributes. It then makes cache admission decisions Using Monte Carlo sampling and a max-value search strategy combined with a feedforward neural network. Secondly, the method considers minimizing system latency and reducing vehicle energy consumption as joint optimization problems. An improved deep reinforcement learning algorithm solves this problem and makes cache-sharding decisions. A prioritized experience replay mechanism is incorporated to adjust the network prediction model quickly and accelerate the convergence process. Experimental results indicate that, compared to existing DRL-based caching methods, PDRL-CM offers faster data processing efficiency and higher cache hit rates under varying vehicle density, storage capacity, and content volume conditions. © 2025

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Rigorous punishment promotes cooperation in prisoners’ dilemma game 7th

Rigorous punishment promotes cooperation in prisoners’ dile...

引用

7th International ICST Conference on Bio-Inspired Models of network, Information, and computing Systems, BIONETICS 2012

作者： Ling, Yun Liu, Jian Zhu, Ping Wei, Guiyi Networking and Distributed Computing Laboratory Zhejiang Gongshang University 18 Xuezheng St Xiasha Higher Education Park Hangzhou China Wasu Media Network Co. Ltd Hangzhou China

ISBN: (纸本)9783319069432

In this paper, we introduce a rigorous punishment mechanism into the prisoners’ dilemma game. In our model, the punisher punishes the defector with fine β at the cost of γ. Monte-Carlo simulations show the evolution of system is jointly affected by β, γ and system’s initial state. We find that when γ is small, the system can evolve into two steady states, i. e., coexisting of cooperators and defectors, and pure punishers. When γ is large, the system can evolve into the only steady state, i. e., coexisting of cooperators and defectors. However, in the middle value of γ, the system can evolve into three steady states, i. e., coexisting of cooperators and defectors, a rock-paper-scissors type of cyclic dominance, and pure cooperators. These results are explained by average total payoff, transition possibility and evolutionary snapshot. We also find the heterogeneity of population distribution can affect cooperation as well. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2014.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

A hierarchical CPU scheduler for multimedia operating systems* 2

A hierarchical CPU scheduler for multimedia operating system...

引用

2nd USENIX Symposium on Operating Systems Design and Implementation, OSDI 1996

作者： Goyal, Pawan Guo, Xingang Vin, Harrick M. Distributed Multimedia Computing Laboratory Department of Computer Sciences University of Texas at Austin Taylor Hall 2.124 AustinTX78712-1188 United States

The need for supporting variety of hard and soft real-time, as well as best effort applications in a multimedia computing environment requires an operating system framework that: (1) enables different schedulers to be employed for different application classes, and (2) provides protection between the various classes of applications. We argue that these objectives can be achieved by hierarchical partitioning of CPU bandwidth, in which an operating system partitions the CPU bandwidth among various application classes, and each application class, in turn, partitions its allocation (potentially using a different scheduling algo-rithm) among its sub-classes or applications. We present Start-time Fair Queuing (SFQ) algorithm, which enables such hierarchical partitioning. We have implemented a hierarchical scheduler in Solaris 2.4. We describe our implementation, and demonstrate its suitability for mul-timedia operating systems.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：