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

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

作者： Xiaojun Yang Tao Liu Fei Chen Hailiang Cheng National Research Center for Intelligent Computing Systems Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy and Sciences China Graduate University of Advanced Studies (SOKENDAI) Beijing China Key Laboratory of Computer System and Architecture Institute of Computing TechnologyNational Research Center for Intelligent Computing Systems Chinese Academy and Sciences China

MemoryIO, a sort of extended I/O in embedded systems, is presented in this paper. MemoryIO makes it powerful for embedded systems to achieve the high-performance interconnect. In view of the facts that the main memory system is absolutely necessary in any embedded system, and not all embedded systems integrate HyperTransport (HT), PCI Express or RapidIO interface, the MemoryIO based interconnect in embedded systems has more universalities compared with that based on HT, PCI Express or RapidIO. MemoryIO can not only thoroughly compensates for the lack of high performance data transfer channel, but also efficiently utilizes the memory bus bandwidth and the direct memory access (DMA) engine to reduce the latency for data transfer in embedded systems. This paper discusses some key technologies of MemoryIO, and presents its application in DCNet and the implementation of MemoryIO IP core. The MemoryIO technology can be used in various systems, but not limited to embedded systems.

关键词： Embedded system Payloads Switches Clocks Storage area networks Physical layer Protocols

来源：评论

学校读者我要写书评

暂无评论

Efficient Strategies for Workload Distribution in Heterogeneous Computing systems

Efficient Strategies for Workload Distribution in Heterogene...

引用

IEEE International Conference on Computational Science and Engineering Workshops (CSEWORKSHOPS)

作者： Jean Marcos Laine Edson Toshimi Midorikawa Laboratory of Architecture and High Performance Computing Department of Computer Engineering and Digital Systems Polytechnic School University of São Paulo Sao Paulo Brazil

ISBN: (纸本)9780769532578

An effective workload distribution has a prime rule on reducing the total execution time of a parallel application on heterogeneous environments, such as computational grids and heterogeneous clusters. This paper presents two approaches to workload distribution based on analytical models developed to performance prediction of parallel applications, named VRP and VRP-SS. The workload is distributed based on relative performance ratios, obtained by analytical models constructed according to the rules described in the PEMPIs methodology. In the experimental tests we evaluated the strategies and compared them using MPI applications. The results showed the efficiency of our strategies by reducing the total execution time and improving the workload balance.

关键词： Load management Analytical models Indexes Processor scheduling Computational modeling Ethernet networks SDRAM

来源：评论

学校读者我要写书评

暂无评论

Scheduling of dataflow models within the Reconfigurable Video Coding framework

Scheduling of dataflow models within the Reconfigurable Vide...

引用

IEEE Workshop on Signal Processing systems (SIPS)

作者： Jani Boutellier Veeranjaneyulu Sadhanala Christophe Lucarz Philip Brisk Marco Mattavelli Machine Vision Group University of Oulu Finland Department of Computer Science and Engineering IIT Bombay India Microelectronic Systems Laboratory Switzerland Processor Architecture Laboratory École Polytechnique Fédérale de Lausanne Switzerland

The upcoming reconfigurable video coding (RVC) standard from MPEG (ISO/IEC SC29WG11) defines a library of coding tools to specify existing or new compressed video formats and decoders. The coding tool library has been written in a dataflow/actor-oriented language named CAL. Each coding tool can be represented with an extended finite state machine and the dependencies between the tools are described as dataflow graphs. This paper proposes an approach to derive a multiprocessor execution schedule for RVC systems that are comprised of CAL actors. In addition to proposing a scheduling approach for RVC, an extension to the well-known permutation flow shop scheduling problem that enables rapid run-time scheduling of RVC tasks is introduced.

关键词： Video coding Job shop scheduling IEC standards ISO standards Libraries Transform coding Video compression Decoding Automata Runtime

来源：评论

学校读者我要写书评

暂无评论

A service-oriented priority-based resource scheduling scheme for virtualized utility computing 08

引用

Proceedings of the 15th international conference on High performance computing

作者： Ying Song Yaqiong Li Hui Wang Yufang Zhang Binquan Feng Hongyong Zang Yuzhong Sun Key Lab. of Computer System and Architecture Inst. of Computing Techn. Chinese Academy of Sciences China and National Research Center for Intelligent Computing Systems ICT China and Graduate Univ. of Chinese Academy of Sciences China Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences China and National Research Center for Intelligent Computing Systems ICT China

ISBN: (纸本)9783540898931

In order to provide high resource utilization and QoS assurance inutility computing hosting concurrently various services, this paper proposes aservice computing framework-RAINBOW for VM(Virtual Machine)-basedutility computing. In RAINBOW, we present a priority-based resourcescheduling scheme including resource flowing algorithms (RFaVM) to optimizeresource allocations amongst services. The principle of RFaVM is preferentiallyensuring performance of some critical services by degrading of others to someextent when resource competition arises. Based on our prototype, we evaluateRAINBOW and RFaVM. The experimental results show that RAINBOWwithout RFaVM provides 28%-324% improvements in service performance,and 26% higher the average CPU utilization than traditional service computingframework (TSF) in typical enterprise environment. RAINBOW with RFaVMfurther improves performance by 25%-42% for those critical services whileonly introducing up to 7% performance degradation to others, with 2%-8%more improvements in resource utilization than RAINBOW without RFaVM.

关键词： resource scheduling utility computing virtualization

来源：评论

学校读者我要写书评

暂无评论

Using cellular automata for parallel simulation of laser dynamics with dynamic load balancing

引用

International Journal of High Performance systems architecture 2008年第4期1卷 251-259页

作者： Guisado, J.L. de Vega, F. Fernández Jiménez-Morales, F.J. Iskra, K.A. Sloot, P.M.A. Departamento de Arquitectura y Tecnología de Computadores Universidad de Sevilla ETS Ingeniería Informática Avda. Reina Mercedes s/n. 41012 Sevilla Spain Centro Universitario de Mérida Universidad de Extremadura Sta. Teresa Jornet 38 06800 Mérida Badajoz Spain Departamento de Física de la Materia Condensada Universidad de Sevilla P.O. Box 1065 41080 Sevilla Spain Argonne National Laboratory Mathematics and Computer Science Division 9700 South Cass Avenue Argonne IL 60439 United States Section Computational Science Laboratory for Computing Systems Architecture and Programming University of Amsterdam Kruislaan 403 1098 SJ Amsterdam Netherlands

We present an analysis of the feasibility of executing a parallel bioinspired model of laser dynamics, based on cellular automata (CA), on the usual target platform of this kind of applications: a heterogeneous non-dedicated cluster. As this model employs a synchronous CA, using the single program, multiple data (SPMD) paradigm, it is not clear in advance if an appropriate efficiency can be obtained on this kind of platform. We have evaluated its performance including artificial load to simulate other tasks or jobs submitted by other users. A dynamic load balancing strategy with two main differences from most previous implementations of CA based models has been used. First, it is possible to migrate load to cluster nodes initially not belonging to the pool. Second, a modular approach is taken in which the model is executed on top of a dynamic load balancing tool - the Dynamite system - gaining flexibility. Very satisfactory results have been obtained, with performance increases from 60% to 80%. Copyright © 2008, Inderscience Publishers.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

Editorial: Dependability and security

引用

IEEE Transactions on Dependable and Secure Computing 2008年第1期5卷 1-3页

作者： Iyer, Ravishankar K. Gligor, Virgil D. Kalbarczyk, Zbigniew T. Kanoun, Karama Katzenbeisser, Stefan Mukherjee, Shubu Shieh, Shiuhpyng Zorian, Yervant Department of Electrical and Computer Engineering Carnegie Mellon University Microsoft's Trusted Computing Academic Advisory Board Center for Reliable and High-Performance Computing Coordinated Science Laboratory University of Illinois Urbana-Champaign United States IEEE IEEE Computer Society LAAS CNRS IFIP Working Group 10.4 on Dependable Computing and Fault Tolerance Special Interest Group on Dependability Benchmarking IFIP Working Group 10.4 French SEE Technical Committee on Trustworthy Computer Systems SEE Working Group Design and Validation for Dependability Technical University Munich Germany Darmstadt University of Technology ACM IACR Intel's SER Tech Council Intel's Architecture Patent Committee Taiwan Information Security Center NCTU IEEE Reliability Society Taipei and Tainan IACR United States Virage Logic Corp. AT and T Bell Laboratories Logic Vision Inc. University of British Columbia IEEE Test Technology Technical Council

来源：评论

学校读者我要写书评

暂无评论

Protein structure superposition by curve moment invariants and iterative closest point

Protein structure superposition by curve moment invariants a...

引用

2007 1st International Conference on Bioinformatics and Biomedical Engineering, ICBBE

作者： Xu, Dong Li, Hua Gu, Tongjun Key Laboratory of Intelligent Information Processing Key Laboratory of Computer System and Architecture National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Sciences Center for Systems Biology Institute of Biophysics Chinese Academy of Sciences Graduate University Chinese Academy of Sciences

ISBN: (纸本)1424411203

Superimpose one protein tertiary structure to another can help to find similarity between them and further identify functional and evolutionary relationships. We first extract invariant features under rigid body transformation for each protein backbone which is represented by alpha-carbons of all the residues. Then, the invariant features are embedded with Iterative Closest Point algorithm for superposition. With several initialized orientations, pairwise alignment can be achieved accurately only by few iterations. Experiments indicate that our proposed algorithm is competitive with several well-known algorithms and with smallest root mean squared distance. © 2007 IEEE.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Performance Evaluation of Multiple TCP connections in iSCSI

Performance Evaluation of Multiple TCP connections in iSCSI

引用

IEEE/NASA Goddard Conference on Mass Storage systems and Technologies, (MSST)

作者： Bhargava K. Kancherla Ganesh M. Narayan K. Gopinath Computer Architecture and Systems Laboratory Department of Computer Science and Automation Indian Institute of Science Bangalore India

Storage area networks (SANs) based on fibre channel have been used extensively in the last decade while iSCSI is fast becoming a serious contender due to its reduced costs and unified infrastructure. This work examines the performance of iSCSI with multiple TCP connections. Multiple TCP connections are often used to realize higher bandwidth but there may be no fairness in how bandwidth is distributed. We propose a mechanism to share congestion information across multiple flows in "Fair-TCP" for improved performance. Our results show that Fair-TCP significantly improves the performance for I/O intensive workloads.

关键词： Throughput TCPIP Wide area networks Storage area networks Encapsulation Storage automation Bandwidth Transport protocols Optical fiber cables computer architecture

来源：评论

学校读者我要写书评

暂无评论

Common substructure extraction of proteins by geometric invariants

Common substructure extraction of proteins by geometric inva...

引用

10th International Conference on computer-Aided Design and computer Graphics

作者： Xu, Dong Li, Hua Gu, Tongjun Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Key Laboratory of Computer System and Architecture Institute of Computing Technology Chinese Academy of Sciences National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Sciences Center for Systems Biology Institute of Biophysics Chinese Academy of Sciences Graduate University Chinese Academy of Sciences

ISBN: (纸本)9781424415786

Structure alignment could help to find shape similarities between proteins and guide structure classification and fold recognition. Common substructure detection and extraction are especially important, for which could guide the biologist to discover binding site or active site. We represent each segment of alpha-carbon backbone by using dihedral angles and curve moment invariants. Then, local and global structure alignment could be performed by iterative closest point algorithm. Maximum common substructures between a pair of proteins or within a protein could be found. Active sites also could be detected by the proposed algorithm.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

Logic as energy: A SAT-based approach

Logic as energy: A SAT-based approach

引用

2nd International Symposium on Brain, Vision, and Artificial Intelligence, BVAI 2007

作者： Lima, Priscila M. V. Morveli-Espinoza, M. Mariela M. França, Felipe M. G. LAM - Computer Architecture and Microelectronics Laboratory Universidade Federal Do Rio de Janeiro Brazil Departament d'Informàtica Universitat Autònoma de Barcelona Spain COPPE - Systems Engineering and Computer Science Program Universidade Federal Do Rio de Janeiro Brazil

ISBN: (纸本)3540755543

This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus platform. satyrus' compiler takes as input the definition of a problem as a set of pseudo-Boolean constraints and produces, as output, the Energy function of a higher-order artificial neural network. This way, satisfiability of a formula can be associated to global optima. In the case of ARQ-PROP II, global optima is associated to Resolution-based refutation, in such a way that allows for simplified abduction and prediction to be unified with deduction. Besides experimental results on deduction with ARQ-PROP II, this work also corrects the mapping of satisfiability into Energy minima originally proposed by Gadi Pinkas. © 2007 Springer-Verlag Berlin Heidelberg.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：