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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,750 篇 会议
29 册 图书
25 篇 期刊文献

馆藏范围

1,804 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,388 篇 工学
- 1,272 篇 计算机科学与技术...
- 598 篇 软件工程
- 238 篇 信息与通信工程
- 218 篇 电气工程
- 87 篇 控制科学与工程
- 53 篇 电子科学与技术（可...
- 44 篇 机械工程
- 41 篇 生物工程
- 33 篇 动力工程及工程热...
- 26 篇 石油与天然气工程
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 17 篇 生物医学工程（可授...
- 17 篇 网络空间安全
- 15 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 力学（可授工学、理...
- 14 篇 安全科学与工程
307 篇 理学
- 202 篇 数学
- 48 篇 生物学
- 41 篇 物理学
- 39 篇 系统科学
- 30 篇 统计学（可授理学、...
- 25 篇 化学
198 篇 管理学
- 130 篇 管理科学与工程(可...
- 77 篇 图书情报与档案管...
- 57 篇 工商管理
72 篇 医学
- 64 篇 临床医学
16 篇 法学
15 篇 经济学
- 15 篇 应用经济学
15 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

105 篇 distributed comp...
101 篇 distributed comp...
74 篇 parallel process...
59 篇 cloud computing
44 篇 computational mo...
44 篇 parallel computi...
38 篇 distributed data...
37 篇 parallel program...
37 篇 grid computing
36 篇 parallel algorit...
33 篇 computer archite...
31 篇 big data
31 篇 parallel process...
28 篇 application soft...
26 篇 fault tolerance
26 篇 machine learning
25 篇 resource managem...
24 篇 scalability
24 篇 middleware
23 篇 concurrent compu...

机构

9 篇 laboratory of in...
8 篇 zhejiang univ co...
7 篇 plekhanov russia...
7 篇 chinese acad sci...
7 篇 science and tech...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 department of in...
5 篇 shanghai jiao to...
4 篇 college of compu...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 school of inform...
4 篇 univ otago dept ...
3 篇 huazhong univ sc...
3 篇 fuyang rongda co...
3 篇 key laboratory o...
3 篇 department of co...
3 篇 university of el...
3 篇 school of comput...

作者

13 篇 zomaya albert y.
10 篇 shen hong
8 篇 todorov venelin
8 篇 rothermel kurt
7 篇 li kuan-ching
6 篇 leymann frank
6 篇 li y
6 篇 liu jie
6 篇 kopp oliver
5 篇 dimov ivan
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 gankevich ivan
5 篇 albert y. zomaya
5 篇 breitenbuecher u...
5 篇 yang chao-tung
4 篇 li kenli
4 篇 blochinger wolfg...
4 篇 liu yang
4 篇 leung k.

语言

1,730 篇 英文
56 篇 其他
15 篇 中文
10 篇 俄文

检索条件"任意字段=8th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1804 条记录，以下是1051-1060 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Dynamically accessing packet header fields at high-speed

Dynamically accessing packet header fields at high-speed

引用

2011 12th international conference on parallel and distributed computing, applications and technologies, PDCAT 2011

作者： Duncan, Ralph Jungck, Peder Ross, Kenneth CloudShield Technologies SAIC company Sunnyvale CA United States

ISBN: (纸本)9780769545646

A significant part of packet processing consists of detecting whether certain standard protocol headers are present, where they are located and whether they include optional information. Packet processing programs are on tight time budgets, especially to handle speeds in the gigabits per second (gbps) range. thus, high-speed mechanisms for finding and accessing headers are critical. Our approach lets users define headers as C-style structures in a highlevel language, packetC [1], and specify header locations in terms of offsets from the start of the current packet, which is treated as an array of unsigned bytes. these offsets can be expressed in terms of network layer offsets, constant values, runtime-calculated variables and combinations of all of these. this paper focuses on the principal forms these offset expressions can take and on how our FPGAs (Field Programmable Gate Arrays), compiler and interpreter collectively handle them at runtime. For simple and complex header offset scenarios we provide users with intuitive, high-level ways to describe offsets and provide effective runtime mechanisms to access header fields. © 2011 IEEE.

关键词： Network layers

来源：评论

学校读者我要写书评

暂无评论

CHMasters: A scalable and speed-efficient metadata service in distributed file system

CHMasters: A scalable and speed-efficient metadata service i...

引用

2011 12th international conference on parallel and distributed computing, applications and technologies, PDCAT 2011

作者： Xu, Min Zhou, Junrui Zhou, Wei An, Hong Department of Computer Science and Technology University of Science and Technology Hefei 230026 China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)9780769545646

distributed file system (DFS) is playing important roles of supporting large distributed data-intensive applications to meet storage needs. Typically, the design of DFS, such as GFS in Google, DMS in Cisco and TFS in Alibaba, is driven by observations of specific application workloads, internal demands and technological environment. In such systems, the metadata service is a critical factor that can affect the file system performance and availability to a great degree. Five requirements have been summarized for the metadata service: location transparent file service, smart director, efficient speed, strong scalability and friendly collaborator. In this paper, we present metadata service module called CHMasters in our DFS. Consistent hashing protocol is used to relieve potential hot spots on name servers. Files'metadata and master nodes are mapped into the same hash space by consistent hash function. And then files'metadata are scattered to master nodes by clockwise "closest" principle. Chunkserver acts as a client when report its chunks info. Only a small proportion of files'metadata will be rehashed when master nodes state change. A new scalable file mapping strategy is also proposed to map file sizes from few MB to several GB efficiently. After intensive experiments, it shows CHMasters is satisfying the above five requirements. © 2011 IEEE.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

parallel software framework for high-performance multispectral analysis for earth monitoring

Parallel software framework for high-performance multispectr...

引用

6th IEEE international conference on Intelligent Data Acquisition and Advanced computing Systems: Technology and applications, IDAACS'2011

作者： Borovska, Plamenka Lazarova, Milena Technical University of Sofia 8 Kliment Ochridsky blv. Sofia Bulgaria

ISBN: (纸本)9781457714238

the paper presents a software package BlueVision for parallel processing of multispectral data from remote sensing of the Earth. the purpose is to provide a software framework for high-performance analysis aimed at detection and monitoring of different natural hazards. the package consists of five modules that implement parallel computational modules for fire detection, deforestation, soil salinity, water pollution, flooding. Additional module visualizes the detected areas on a geographic map. Performance analysis are based on the experimental results on a heterogeneous multicomputer cluster and the Bulgarian supercomputer BlueGene/P. © 2011 IEEE.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Repair Mechanism for Decentralized Erasure Code based Storage Systems

A Decentralized Repair Mechanism for Decentralized Erasure C...

引用

Int Joint conference of 10th IEEE Int Conf on Trust, Security and Privacy in computing and Communications (TrustCom) / 8th IEEE Int Conf on Embedded Software and Systems (ICESS) / 6th Int Conf on Frontier of Computer Science and Technology (FCST)

作者： Lin, Hsiao-Ying Tzeng, Wen-Guey Lin, Bao-Shuh Natl Chiao Tung Univ Intelligent Informat & Commun Res Ctr Hsinchu Taiwan Natl Chiao Tung Univ Dept Comp Sci Hsinchu Taiwan

ISBN: (纸本)9780769546001

Erasure code based distributed storage systems provide data robustness by storing encoded-fragments over servers. To maintain data robustness, a repair mechanism recovers a storage system from server failures by repairing encoded-fragments. For decentralized erasure code based storage systems, we propose a decentralized repair mechanism. Our mechanism has the following features. Firstly, an encoded-fragment is replenished by a combination of a number u of encoded-fragments that are randomly chosen. Secondly, the number u depends on the number of the available encoded-fragments and is independent of the pattern of missing encoded-fragments. thirdly, multiple encoded-fragments are simultaneously replenished in parallel. We measure the communication cost in terms of the number u of required network connections for replenishing an encoded-fragment. We then conducted a numerical analysis by using traces of real systems. We find that our requirement on u is smaller than that from existing methods. Both theoretical and numerical results show that our decentralized repair mechanism outperforms existing ones in terms of the communication cost under the same consideration of efficiency cost for storage.

关键词： decentralized erasure codes regenerating codes network coding distributed storage

来源：评论

学校读者我要写书评

暂无评论

AVSS 2011 demo session: Interactive person-retrieval in a distributed camera network

AVSS 2011 demo session: Interactive person-retrieval in a di...

引用

2011 8th IEEE international conference on Advanced Video and Signal Based Surveillance, AVSS 2011

作者： Bäuml, Martin Stiefelhagen, Rainer Institute for Anthropomatics Karlsruhe Institute of Technology Adenauerring 2 76137 Karlsruhe Germany Fraunhofer Institute of Optronics System Technologies and Image Exploitation Fraunhoferstr. 1 76131 Karlsruhe Germany

ISBN: (纸本)9781457708459

Tracking and identifying persons in videos are important building blocks in many applications. For interactive investigation of surveillance footage it is often not even necessary to uniquely identify a person. It rather suffices to find occurrences of a person indicated by the user with an exemplary image sequence. We present a system in which the search for a specific person can be initiated by a sample image sequence and then be further refined by interactive feedback by the operator. the demonstrated system will track people online in multiple cameras and make the sequences immediately searchable from a central station. © 2011 IEEE.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

PDCAT 2011 conference organization

PDCAT 2011 Conference organization

引用

IEEE international conference on parallel and distributed computing, applications and technologies (PDCAT)

Provides a listing of current committee members and society officers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource allocation via distributed decisions in cloud environment

Dynamic resource allocation via distributed decisions in clo...

引用

2011 8th IEEE international conference on e-Business Engineering, ICEBE 2011

作者： Chieu, Trieu C. Chan, Hoi IBM T. J. Watson Research Center 19 Skyline Drive Hawthorne NY United States

ISBN: (纸本)9780769545189

the adaptation of virtualization technologies and the Cloud Compute model by Web service providers is accelerating. these technologies commonly known as Cloud Compute Model are built upon an efficient and reliable dynamic resource allocation system. Maintaining sufficient resources to meet peak workloads while minimizing cost determines to a large extend the profitability of a Cloud service provider. Traditional centralized approach of resource provisioning with global optimization and statistical strategies can be complex, difficult to scale, computational intensive and often non-traceable which adds to the cost and efficiency of Cloud operation, especially in industrial environments. As we have learned in real life, the most efficient economic system is the one that provides individuals with incentives for their own decisions. It is also true for computing systems. In this paper, we present an architecture for dynamic resource provisioning via distributed decisions. We will illustrate our approach with a Cloud based scenario, in which each physical resource makes its own utilization decision based on its own current system and workload characteristics, and a light-weight provisioning optimizer with a replaceable routing algorithm for resource provisioning and scaling. this approach enables resource provisioning system to be more scalable, reliable, traceable, and simple to manage. In an industrial setting, the importance of these characteristics often exceeds the goal of squeezing the absolute last CPU cycles of the underlying physical resources. © 2011 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient scheduling algorithm for sporadic real-time tasks in multiprocessor systems

An energy-efficient scheduling algorithm for sporadic real-t...

引用

13th IEEE international Workshop on FTDCS 2011, the 8th international conference on ATC 2011, the 8th international conference on UIC 2011 and the 13th IEEE international conference on HPCC 2011

作者： Zhang, Dong-Song Chen, Fang-Yuan Li, Hong-Hua Jin, Shi-Yao Guo, De-Ke National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China School of Computing Science Simon Fraser University 8888 University Drive Burnaby BC V5A 1S6 Canada National Laboratory for Information System Engineering School of Information Systems and Management National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769545387

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, the real-time energy-efficient scheduling in multiprocessor systems becomes an urgent problem to reduce the system energy consumption while meeting real-time constraints. For a multiprocessor with independent DVFS and DPM at each processor, this paper proposes an energy-efficient real-time scheduling algorithm named LRE-DVFS-EACH, based on LRE-TL which is an optimal real-time scheduling algorithm for sporadic tasks. LRE-DVFS-EACH utilizes the concept of TL plane and the idea of fluid scheduling to dynamically scale the voltage and frequency of processors at the initial time of each TL plane as well as the release time of a sporadic task in each TL plane. Consequently, LRE-DVFS-EACH can obtain a reasonable tradeoff between the real-time constraints and the energy saving. LRE-DVFS-EACH is also adaptive to the change of workload caused by the dynamic release of sporadic tasks, which can obtain more energy savings. the experimental results show that compared with existing algorithms, LRE-DVFS-EACH can not only guarantee the optimal feasibility of sporadic tasks, but also achieve more energy savings in all cases, especially in the case of high workloads. © 2011 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Measured characteristics of futuregrid clouds for scalable collaborative sensor-centric grid applications

Measured characteristics of futuregrid clouds for scalable c...

引用

2011 12th international conference on Collaboration technologies and Systems, CTS 2011

作者： Fox, Geoffrey C. Ho, Alex Chan, Eddy School of Informatics and Computing Community Grids Laboratory Indiana University Bloomington 47408 United States Anabas Inc. 580 California Street San Francisco 94104 United States

ISBN: (纸本)9781612846378

the emergence of cloud technology has raised a renewed emphasis on the issue of scalable on-demand computing. Cloud back-end support of small devices such as sensors and mobile phones is one important application. We report our preliminary study of measured characteristics of distributed cloud computing infrastructure for collaboration sensor-centric applications on the FutureGrid [1, 2]. We focus on understanding the characteristics of the underlying network and its impact on multipoint, distributed cloud scalability. We report our findings in areas of performance, scalability and reliability at the network level using standard network performance tools. We measure data at the message level using the NaradaBrokering system [3-8] by the Indiana University Community Grids Laboratory which supports a large number of practical communication protocols. Results are also presented at the collaboration and communication applications level using the Anabas sensor-centric grid framework [9], a message-based sensor service management and sensor-centric application development framework. Geographically distributed and heterogeneous clouds in the FutureGrid are used because of their support for scalable simulations. Our preliminary data indicates that a heterogeneous cloud infrastructure like FutureGrid coupled with a flexible collaborative sensor-centric grid framework is suitable for the study and development of new, scalable, collaborative sensor-centric system software and applications. © 2011 IEEE.

关键词： distributed cloud

来源：评论

学校读者我要写书评

暂无评论

An Efficient Architectural Design of Hardware Interface for Heterogeneous Multi-core System

An Efficient Architectural Design of Hardware Interface for ...

引用

8th IFIP international conference on Network and parallel computing

作者： Gu, Xiongli Yang, Jie Wu, Xiamin Huang, Chunming Liu, Peng Zhejiang Univ Dept Informat Sci & Elect Engn Hangzhou 310027 Zhejiang Peoples R China UTStarcom Co Ltd Elect & Informat Engn Dept Hangzhou 310053 Zhejiang Peoples R China

ISBN: (纸本)9783642244025;9783642244032

How to manage the message passing among inter processor cores with lower overhead is a great challenge when the multi-core system is the contemporary solution to satisfy high performance and low energy demands in general and embedded computing domains. Generally speaking, the networks-on-chip connects the distributed multi-core system. It takes charge of message passing which including data and synchronization message among cores. the size of most data transmission is typically large enough that it remains strongly bandwidth-bound. the synchronization message is very small which is primarily latency bound. thus the separated networks-on-chip are needed to transmit the above two types of message. In this paper we focus on the network for the transmission of synchronization messages. A hardware module message passing unit (MPU) is proposed to manage the synchronization message passing for the heterogeneous multi-core system. Compared with the original single network approach, this solution reduces the run-time object scheduling and synchronization overhead effectively, thereby, improving the whole system performance.

关键词： data flow graph (DFG) multi-core system parallel programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共181页 << < 102 103 104 105 106 107 108 109 110 111 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：