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

Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques

Optimal and near-optimal allocation of precedence-constraine...

引用

International Conference on parallel processing (ICPP)

作者： I. Ahmad Yu-Kwong Kwok Department of Computer Science Hong Kong University of Science and Technology Hong Kong China Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

Obtaining an optimal schedule for a set of precedence-constrained tasks with arbitrary costs is a well-known NP-complete problem. However, optimal solutions are desired in many situations. In this paper we propose search-based algorithms for determining optimal schedules for moderately large problem sizes. The first algorithm which is based on the A* search technique uses a computationally efficient cost function for guiding the search with reduced complexity. We propose a number of state-pruning techniques to reduce the size of the search space. For further lowering the complexity, we parallelize the search. The parallel version is based on reduced interprocessor communication and is guided by static and dynamic load-balancing schemes to evenly distribute the search states to the processors. We also propose an approximate algorithm that guarantees a bounded deviation from the optimal solution but takes considerably shorter time. Based on an extensive experimental evaluation of the algorithms, we conclude that the parallel algorithm with pruning techniques is an efficient scheme for generating optimal solutions for medium to moderately large problems while the approximate algorithm is a useful alternative if slightly degraded solutions are acceptable.

关键词： Optimal scheduling Processor scheduling Computational efficiency Costs Concurrent computing Network topology Scheduling algorithm computer science Laboratories Multiprocessor interconnection networks

来源：评论

学校读者我要写书评

暂无评论

Synchronized Cell-Balancing Charging of Supercapacitors

引用

IFAC-PapersOnLine 2017年第1期50卷 3338-3343页

作者： Li H. Peng J. He J. Huang Z. Pan J. School of Information Science and Engineering Central South University Changsha 410087 China Department of Computer Science University of Victoria Victoria V8P5C2 Canada Dept. of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Shanghai 200240 China

As a classical cell balancing solution in low-power supercapacitor applications, the switched resistor circuit is vulnerable to resistance deviation effects with existing cell balancing methods. In this paper, we propose a synchronized cell balancing method for switched resistor circuits based on the consensus theory and a cyber-physical approach, with the aim of synchronizing cell voltages before they are fully charged. It is shown that the proposed cell-balancing algorithm is robust to resistance deviation effects. Extensive simulations are provided to show the effectiveness of the proposed method. © 2017

关键词： Cell balancing Charging Consensus Cyber-physical systems Supercapacitors

来源：评论

学校读者我要写书评

暂无评论

The dynamic allocation model for the resources of cloud services delivery networks

引用

Jisuanji Xuebao/Chinese Journal of computers 2011年第12期34卷 2305-2318页

作者： Shi, Pei-Chang Wang, Huai-Min Yin, Gang Liu, Xue-Ning Yuan, Xiao-Qun Shi, Dian-Xi National Laboratory for Parallel and Distributed Processing School of Computer and Science National University of Defense Technology Changsha 410073 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Department of Electronics and Information Engineering Huazhong Univ. of Sci. and Technol. Wuhan 430074 China

Cloud Services Delivery Networks (CSDN) constructs a layer distributed server overlay over the Internet, which uses the way to the nearest and on-demand approach providing services to end users. Facing the scale and diversification of the resource demand characteristics of the Internet cloud services, CSDN forms different logical sub-server overlay for different kinds of cloud services. However, most servers and bandwidth resources of CSDN are used to deliver the streaming and downloading kind of cloud services, and the dynamic allocation of their delivery resource is the main research emphasis in this paper. This paper first models the problem to be a multi-dimensional facility location problem, according to the two characteristics: the memory resource and bandwidth resource of this kind of application are the bottleneck resource;the hot contents of this kind of application can be delivered using the Peer-to-Peer mechanisms. After the model analyzed and its NP-Complete proved, we then propose a heuristic algorithm. Finally, using the service delivery cost savings as the performance metrics, while the actual system's operation trace is as the input, the effectiveness of the algorithm are comprehensively assessed.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Speculative prefetching of induction pointers 10th

Speculative prefetching of induction pointers

引用

10th International Conference on Compiler Construction, CC 2001 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2001

作者： Stoutchinin, Artour Amaral, José Nelson Gao, Guang R. Dehnert, James C. Jain, Suneel Douillet, Alban STMicroelectronics Grenoble France Department of Computing Science University of Alberta EdmontonAB Canada Computer Architecture and Parallel System Laboratory University of Delaware NewarkDE United States Transmeta Co Santa ClaraCA United States Hewlett-Packard Co CupertinoCA United States

ISBN: (纸本)354041861X

We present an automatic approach for prefetching data for linked list data structures. The main idea is based on the observation that linked list elements are frequently allocated at constant distance from one another in the heap. When linked lists are traversed, a regular pattern of memory accesses with constant stride emerges. This regularity in the memory footprint of linked lists enables the development of a prefetching framework where the address of the element accessed in one of the future iterations of the loop is dynamically predicted based on its previous regular behavior. We automatically identify pointer-chasing recurrences in loops that access linked lists. This identification uses a surprisingly simple method that looks for induction pointers | pointers that are updated in each loop iteration by a load with a constant offset. We integrate induction pointer prefetching with loop scheduling. A key intuition incorporated in our framework is to insert prefetches only if there are processor resources and memory bandwidth available. In order to estimate available memory bandwidth we calculate the number of potential cache misses in one loop iteration. Our estimation algorithm is based on an application of graph coloring on a memory access interference graph derived from the control flow graph. We implemented the prefetching framework in an industry-strength production compiler, and performed experiments on ten benchmark programs with linked lists. We observed performance improvements between 15% and 35% in three of them. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Prediction of piRNA-mRNA interactions based on an interactive inference network

Prediction of piRNA-mRNA interactions based on an interactiv...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Liu, Yajun Li, Ru Li, Aimin Fei, Rong Guo, Xie Wu, Fang-Xiang Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China University of Saskatchewan Division of Biomedical Engineering Department of Computer Science Department of Mechanical Engineering Saskatoon Canada

ISBN: (纸本)9798350337488

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions. © 2023 IEEE.

关键词： interactive inference network noncoding RNA piRNA-mRNA interactions positive-unlabeled learning

来源：评论

学校读者我要写书评

暂无评论

Semantic web service composition using answer set planning

引用

International Journal of Advancements in Computing Technology 2011年第5期3卷 20-31页

作者： Qian, Jun-Yan Huang, Guo-Wang Zhao, Ling-Zhong National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Department of Computer science and engineering Guilin University of Electronic Technology Guilin 541004 China

This paper presents a method that adapting planning description to bring the semantic information into play for service composition through action language C. It shows how service descriptions can be expressed by preconditions and effects and the action language C provides a richer syntax and semantic for complex service descriptions. We also presents the algorithm of Translating semantic Web service described by OWL-S to action language C. Thanks to the structured description and the powerful expression of C, we only consider the initial Situation and the desired goal ignoring details of transition and planning. At last we use satisfiability planning to solve the planning problem by translating the action language into disjunctive logic program.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Grid and Cooperative Computing - GCC 2004 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Hai Jin Yi Pan Nong Xiao Jianhua Sun

ISBN: (数字)9783540302087

ISBN: (纸本)9783540235644

Welcome to the proceedings of GCC2004 and the city of Wuhan. Grid computing has become a mainstream research area in computer science and the GCC conference has become one of the premier forums for presentation of new and exciting research in all aspectsofgridandcooperativecomputing. Theprogramcommitteeispleasedtopresent the proceedings of the 3rd International Conference on Grid and Cooperative Comp- ing (GCC2004), which comprises a collection of excellent technical papers, posters, workshops, and keynote speeches. The papers accepted cover a wide range of exciting topics, including resource grid and service grid, information grid and knowledge grid, grid monitoring,managementand organizationtools, grid portal, grid service, Web s- vices and their QoS, service orchestration, grid middleware and toolkits, software glue technologies, grid security, innovative grid applications, advanced resource reservation andscheduling,performanceevaluationandmodeling,computer-supportedcooperative work, P2P computing, automatic computing, and meta-information management. The conference continues to grow and this year a record total of 581 manuscripts (including workshop submissions) were submitted for consideration. Expecting this growth, the size of the program committee was increased from 50 members for GCC 2003 for 70 in GCC 2004. Relevant differences from previous editions of the conf- ence: it is worth mentioning a signi?cant increase in the number of papers submitted by authors from outside China; and the acceptance rate was much lower than for p- vious GCC conferences. From the 427 papers submitted to the main conference, the program committee selected only 96 regular papers for oral presentation and 62 short papers for poster presentation in the program.

关键词： Theory of Computation computer Communication Networks Operating systems Software Engineering Information systems Applications (incl. Internet) Information Storage and Retrieval

来源：评论

学校读者我要写书评

暂无评论

parallel Monte Carlo algorithms for sparse SLAE using MPI 6th

Parallel Monte Carlo algorithms for sparse SLAE using MPI

引用

6th European parallel Virtual Machine and Message Passing Interface Users’ Group Meeting, 1999

作者： Alexandrov, V. Karaivanova, A. Department of Computer Science University of Liverpool Chadwick Building Peach Street LiverpoolL69 7ZF United Kingdom Central Laboratory for Parallel Processing Bulgarian Academy of Sciences Acad. G. Bonchev St.bl. 25 A Sofia1113 Bulgaria

ISBN: (纸本)3540665498

The problem of solving sparse systems of Linear Algebraic Equations (SLAE) by parallel Monte Carlo numerical methods is considered. The almost optimal Monte Carlo algorithms are presented. In case when a copy of the non-zero matrix elements is sent to each processor the execution time for solving SLAE by Monte Carlo on p processors is bounded by O(nNdT/p) where N is the number of chains, T is the length of the chain in the stochastic process, which are independent of matrix size n, and d is the average number of non-zero elements in the row. Finding a component of the solution vector requires O(NdT/p) time on p processors, which is independent of the matrix size n. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

An Optimal Mapping Algorithm Based on Balanced Load Cutting for DVE systems

An Optimal Mapping Algorithm Based on Balanced Load Cutting ...

引用

International Symposium on Intelligent Information Technology Application, IITA

作者： Wei Zhang Min Xi Hangjun Zhou Yuxing Peng Sikun Li National Laboratory for Parallel and Distributed Processing National University of Defense Technology ChangSha China Department of Computer Science Xi'an Jiaotong University Xi'an China

In distributed virtual environment (DVE) systems, a distributed server infrastructure is often used to reduce the latency between servers and clients. Under this infrastructure, mapping clients to proper servers is one of the key issues for improving the interactivity and overall performance. Most traditional methods of mapping the clients to servers only consider the load balancing problem. However, there are two other important aspects that should be involved: the physical world integrity and the virtual world integrity. In this work, we propose a novel mapping algorithm which takes care of all three aspects at the same time. The algorithm converts the mapping problem into cutting stage and matching stage to get optimal result with polynomial complexity. The experimental results show that our algorithm improves the overall performance of DVE systems significantly.

关键词： Delay Network servers computer science Virtual environment Load management Polynomials Quality of service Information technology Application software Distributed processing

来源：评论

学校读者我要写书评

暂无评论

Collaborative Search in Large-scale Unstructured Peer-to-Peer Networks

Collaborative Search in Large-scale Unstructured Peer-to-Pee...

引用

International Conference on parallel processing (ICPP)

作者： Yiming Zhang Dongsheng Li Lei Chen Xicheng Lu National Laboratory for Parallel and Distributed Processing National University of Defense Technology China Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

Searching in large-scale unstructured peer-to-peer networks is challenging due to the lack of effective hint information to guide queries. In this paper, we propose POP, a parallel, collaborative and Probabilistic search mechanism, in which query messages are viewed as search units to collaborate with each other and aggregate the distributed hints during the search process. A scheme called distributed Bloom filter (DBF) is presented to propagate the hints with a bandwidth-aware manner, in which a node divides the received Bloom filter vector into subvectors and disseminates the fragments to its neighbors according to their bandwidth capacity. The effectiveness of POP is demonstrated through theoretical analysis and extensive simulations.

关键词： Large-scale systems Peer to peer computing Bandwidth Information filtering Information filters Analytical models Aggregates Space technology International collaboration Laboratories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：