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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

293 篇 会议
8 册 图书
4 篇 期刊文献

馆藏范围

305 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

192 篇 工学
- 176 篇 计算机科学与技术...
- 87 篇 软件工程
- 27 篇 电气工程
- 16 篇 电子科学与技术（可...
- 15 篇 信息与通信工程
- 9 篇 控制科学与工程
- 8 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 动力工程及工程热...
- 3 篇 机械工程
- 3 篇 生物医学工程（可授...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 环境科学与工程（可...
- 2 篇 安全科学与工程
40 篇 理学
- 23 篇 数学
- 10 篇 系统科学
- 8 篇 生物学
- 5 篇 物理学
- 4 篇 统计学（可授理学、...
- 2 篇 大气科学
- 1 篇 化学
- 1 篇 地理学
- 1 篇 地球物理学
29 篇 管理学
- 22 篇 管理科学与工程(可...
- 16 篇 工商管理
- 10 篇 图书情报与档案管...
2 篇 农学
2 篇 医学
- 2 篇 基础医学(可授医学...
- 2 篇 临床医学
- 2 篇 公共卫生与预防医...

主题

22 篇 parallel process...
17 篇 cloud computing
16 篇 distributed comp...
15 篇 computational mo...
13 篇 routing
12 篇 computer archite...
11 篇 scalability
11 篇 servers
10 篇 graphics process...
10 篇 peer-to-peer com...
9 篇 concurrent compu...
9 篇 resource managem...
9 篇 protocols
9 篇 hardware
9 篇 distributed comp...
8 篇 runtime
8 篇 monitoring
8 篇 real-time system...
8 篇 performance eval...
7 篇 computer science

机构

5 篇 institute of com...
3 篇 university of ch...
2 篇 school of scienc...
2 篇 vienna universit...
2 篇 shanghai key lab...
2 篇 guangdong provin...
2 篇 college of compu...
2 篇 department of co...
2 篇 tu münchen garch...
2 篇 school of comput...
2 篇 green univ bangl...
2 篇 univ chinese aca...
2 篇 school of cybers...
2 篇 school of comput...
2 篇 university of pi...
2 篇 isislab - dipart...
2 篇 department of co...
2 篇 institute of par...
2 篇 tennessee tech u...
2 篇 rwth aachen univ...

作者

3 篇 hai jin
3 篇 gonzalez teofilo...
2 篇 dan meng
2 篇 li cui
2 篇 roy palash
2 篇 chaudhary vipin
2 篇 haibin cai
2 篇 hassan mohammad ...
2 篇 michael alexande...
2 篇 liu yang
2 篇 roberto g. casce...
2 篇 shigeng zhang
2 篇 qiang li
2 篇 alexandru costan
2 篇 ammar reda a.
2 篇 luís lopes
2 篇 emmanuel jeannot
2 篇 vittorio scarano
2 篇 xiaofei liao
2 篇 stephen l. scott

语言

304 篇 英文
1 篇 中文

检索条件"任意字段=20th International Conference on Parallel and Distributed Computing Systems, PDCS 2007"

共 305 条记录，以下是271-280 订阅

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

详细简洁

排序：

Locality-Aware distributed Loop Scheduling for Chip Multiprocessors

Locality-Aware Distributed Loop Scheduling for Chip Multipro...

引用

international conference on VLSI Design

作者： L. Xue M. Kandemir G. Chen F. Li O. Ozturk R. Ramanarayanan B. Vaidyanathan Computer Science and Engineering Department Pennsylvania State University USA Computer Science and Engineering Department Pennsylvania State University

ISBN: (纸本)9780769527628;0769527620

Chip multiprocessors are becoming increasingly popular in embedded domain since they have important advantages over their single core counterparts from the parallelism, power efficiency, validation, and verification perspectives. However, extracting maximum performance from these multiprocessors requires compiler support in form of effective code parallelization. the goal of this paper is to present and experimentally evaluate a locality aware dynamic loop scheduling strategy that implements both locality aware loop iteration distribution across parallel processors and dynamic load balancing at runtime. this hybrid scheme has been implemented and tested along with four other previously-proposed loop scheduling schemes, including a locality aware one. Our experimental analysis reveals that the proposed approach generates better results than all other scheduling schemes (static or dynamic) tested. Our results also show that the improvements brought by the proposed scheduling scheme are consistent across experiments with different values of our major simulation parameters such as the number of processors and cache size per processor

关键词： Processor scheduling Dynamic scheduling Runtime Testing Computer science Power engineering and energy parallel processing Load management System-on-a-chip Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Fengyun-4A Meteorological Satellite Data Service System

Fengyun-4A Meteorological Satellite Data Service System

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Yonggang Qi Jiashen Zhang Zhe Xu Di Xian National Satellite Meteorological Center China Meterological Administration Beijing China

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126173

this paper introduces the characteristics and the new technologies applied in Fengyun-4A(FY-4A) Data Service System. the system is an important part of Fengyun-4(FY-4) series satellite ground application system, and also is the new generation platform for meteorological satellite data sharing services. the system integrates several high-performance servers, high availability disk array, large-scale automated tape library as well as operation system, database, storage software and application software, all of which constitutes archive and service application clusters. the system adopts cloud-computing technology, big data technology, WEBGIS technology to establish a stable, reliable and secure operational satellite data archive platform, which not only provides data retrieval and download services, but also provides various auxiliary means and information assistance.

关键词： Satellite broadcasting Satellites Real-time systems Meteorology Cloud computing Monitoring Data centers

来源：评论

学校读者我要写书评

暂无评论

Blockchain Consensus Algorithm Design Based on Consistent Hash Algorithm

Blockchain Consensus Algorithm Design Based on Consistent Ha...

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Jian Yang Hong Shen School of Data and Computer Science Sun Yat-sen University Guangzhou China School of Computer Science University of Adelaide Australia

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126173

Blockchain, the concept from Bitcoin created by Satoshi Nakamoto, has the potential to decentralise traditionally centralised systems. Blockchain is a distributed ledger for recording information, stored by many nodes without a central organization through distributed systems and cryptography. the consensus algorithm is a protocol that guarantees the consistency of all data in a blockchain system. It is a key for building a blockchain system and an important part that affects the performance of the blockchain system. In this paper, we firstly compare the usage scenarios of different consensus algorithms, their advantages and disadvantages. After that, we present a new consensus algorithm in permissioned blockchain based on consistent hashing. For blockchain system construction, we propose a new design of the hash ring. the pseudo-randomness of the hash operation is used to ensure the randomness of the electoral leadership node in the blockchain system. It avoids the security risk of the fixed leadership node model. Our algorithm is applicable to blockchain systems containing Byzantine nodes and has a high throughput, low delay and many other advantages. Its communication complexity is O(n), significantly better than that of the practical Byzantine fault tolerance algorithm whose communication complexity is O(n2).

关键词： Peer-to-peer computing Fault tolerance Fault tolerant systems Protocols Cryptography Delays

来源：评论

学校读者我要写书评

暂无评论

Hybrid Parameter Update: Alleviating Imbalance Impacts for distributed Deep Learning

Hybrid Parameter Update: Alleviating Imbalance Impacts for D...

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Hongliang Li Dong Xu Zhewen Xu Xiang Li College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education Changchun China

Nowadays, data parallelism has been widely applied to train large datasets on distributed deep learning clusters, but it has suffered from costly global parameter updates at batch barriers. Performance imbalance among worker instances, introduced by uneven workload partitioning or biased resource allocation, can cause straggly workers, which can lead to severe impacts on both training speed and result accuracy. this paper studies the issue focusing on the tradeoff between training speed and result accuracy. We propose Cooperate Grouping parallel (CGP), a hybrid parameter update solution that allows the flexibility of both synchronous and asynchronous update schemes. We introduce a novel Cooperate Worker Grouping Problem (CWGP) that seeks a task grouping configuration that leads to maximum model accuracy and holds customized training speed guarantees. We propose an evolution-based Pareto local searching algorithm to compute efficient worker grouping configurations. Comprehensive evaluation results are presented to demonstrate the effectiveness of CGP under both persistent and fluctuant imbalances. the proposed method alleviates the imbalance impacts without introducing extra adjustment over-heads.

关键词： Training Deep learning Computational modeling Focusing distributed databases parallel processing Resource management

来源：评论

学校读者我要写书评

暂无评论

WorkQ: A many-core producer/consumer execution model applied to PGAS computations

WorkQ: A many-core producer/consumer execution model applied...

引用

international conference on parallel and distributed systems (ICPADS)

作者： David Ozog Allen Malony Jeff R. Hammond Pavan Balaji Dept. of Computer and Information Science University of Oregon Eugene Oregon Parallel Computing Lab Intel Corporation Hillsboro Oregon Math. and Computer Science Div. Argonne National Laboratory Lemont Illinois

ISBN: (纸本)9781479976164

Partitioned global address space (PGAS) applications, such as the Tensor Contraction Engine (TCE) in NWChem, often apply a one-process-per-core mapping in which each process iterates through the following work-processing cycle: (1) determine a work-item dynamically, (2) get data via one-sided operations on remote blocks, (3) perform computation on the data locally, (4) put (or accumulate) resultant data into an appropriate remote location, and (5) repeat the cycle. However, this simple flow of execution does not effectively hide communication latency costs despite the opportunities for making asynchronous progress. Utilizing nonblocking communication calls is not sufficient unless care is taken to efficiently manage a responsive queue of outstanding communication requests. this paper presents a new runtime model and its library implementation for managing tunable “work queues” in PGAS applications. Our runtime execution model, called WorkQ, assigns some number of on-node “producer” processes to primarily do communication (steps 1, 2, 4, and 5) and the other “consumer” processes to do computation (step 3); but processes can switch roles dynamically for the sake of performance. Load balance, synchronization, and overlap of communication and computation are facilitated by a tunable nodewise FIFO message queue protocol. Our WorkQ library implementation enables an MPI+X hybrid programming model where the X comprises SysV message queues and the user's choice of SysV, POSIX, and MPI shared memory. We develop a simplified software mini-application that mimics the performance behavior of the TCE at arbitrary scale, and we show that the WorkQ engine outperforms the original model by about a factor of 2. We also show performance improvement in the TCE coupled cluster module of NWChem.

关键词： Computational modeling Libraries Tensile stress Load modeling Electronics packaging Engines Runtime

来源：评论

学校读者我要写书评

暂无评论

Application Specific Datapath Extension with distributed I/O Functional Units

Application Specific Datapath Extension with Distributed I/O...

引用

international conference on VLSI Design

作者： Nagaraju Pothineni Anshul Kumar Kolin Paul Department of Computer Science Indian Institute of Technology New Delhi India

ISBN: (纸本)9780769527628;0769527620

Performance of an application can be improved through augmenting the processor with application specific functional units (AFUs). Usually a cluster of operations identified from the application forms the behavior of an AFU. Several researchers studied the impact of input and output (I/O) constraints for a legal operation cluster on the overall achievable speedup. the general observation is that the speedup potential grows with the relaxation of I/O constraints. Going further, in this paper, the authors investigate the speedup potential of AFUs in the absence of I/O constraints. Design challenge in the absence of I/O constraints is addressed in a very practical manner, through the identification of maximal convex subgraphs. Usually the available register ports are few but the number of inputs/outputs of the identified patterns are likely to be large. the authors solve the register port limitation by the design of distributed I/O functional units, in which the operands are communicated in multiple cycles. the experimental results show that selection of maximal clusters achieves average 50% higher speedup than selecting I/O constrained operation clusters. Also, our identification algorithm runs 2 to 3 orders faster than an exhaustive identification approach

关键词： Application software Reduced instruction set computing Law Legal factors Registers Application specific processors Hardware Automation Software tools Computer science

来源：评论

学校读者我要写书评

暂无评论

Multi-Node Global Directory Construction in Peer-to-Peer systems

Multi-Node Global Directory Construction in Peer-to-Peer Sys...

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： InSung Kang HongSoo Kim SungJin Choi MaengSoon Baik ChongSun Hwang Distributed Systems Laboratory Department of Computer Science and Engineering Korea University Seoul South Korea

In P2P systems, the speed of searching for desired lists of sharable files is one of the most important measurement issues in evaluation of overall system performance. Although the searching schemes of existing non-structured P2P systems have been improved to enhance speed considerably, they still never reach to the level of those of the centralized and structured systems. In this paper, we propose a multi-node global directory in P2P systems, where all the lists of sharable resources of the joining peers are aggregated and divided into the chosen nodes while keeping collating sequence as a whole to make one big linked list. thus in indexed sequential searching, the system provides us with convenience of using the command like 'dir' of MS-DOS, and in general keyword searching, which is naturally impossible for the structured P2P systems, the searching speed is even faster than those of centralized P2P systems since a small list segment is scanned at each node synchronously in parallel

关键词： Peer to peer computing Keyword search System performance Laboratories Computer science Velocity measurement Power generation economics Machine vision Bandwidth Memory

来源：评论

学校读者我要写书评

暂无评论

Characterizing Dynamic Properties of the SopCast Overlay Network

Characterizing Dynamic Properties of the SopCast Overlay Net...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Kênia Carolina Goncalves Alex Borges Vieira Jussara M. Almeida Ana Paula C. da Silva Humberto Marques-Neto Sergio V.A. Campos Computer Science Department Universidade Federal de Minas Gerais Brazil Computer Science Department Universidade Federal de Juiz de Fora Brazil Computer Science Department PUC-Minas Brazil

Peer-to-Peer live video streaming systems are becoming increasingly popular. Nevertheless, in spite of various studies of client behavior aspects and system optimizations, the current knowledge about the dynamic properties of the system, particularly how the P2P overlay network changes over time during a live transmission, is still superficial. In this paper, we provide a characterization of the dynamic properties of a popular P2P live streaming media application, namely Sop Cast. We use complex network metrics to analyze how the structure of the network evolves over time from the perspective of individual nodes (local view) and of the whole network (global view). We find that Sop Cast peers may be clustered into three profiles based on their centrality properties in the network. Moreover, in spite of peers changing their partners over time, they tend to remain with the same centrality profile. Also, the global network structure tends to remain roughly stable over time, except for a decaying clustering coefficient. Our findings can be used to generate more realistic synthetic P2P workloads and to drive future system designs and simulations.

关键词： Peer to peer computing Measurement Crawlers Integrated circuits Monitoring Streaming media Servers

来源：评论

学校读者我要写书评

暂无评论

A Holistic Stream Partitioning Algorithm for distributed Stream Processing systems

A Holistic Stream Partitioning Algorithm for Distributed Str...

引用

IEEE international conference on parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Kejian Li Gang Liu Minhua Lu Guangdong Province Key Laboratory of Popular High Performance Computers Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of biomedical engineering Shenzhen University Shenzhen China

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126173

the performances of modern distributed stream processing systems are critically affected by the distribution of the load across workers. Skewed data streams in real world are very common and pose a great challenge to these systems, especially for stateful applications. Key splitting, which allows a single key to be routed to multiple workers, is a great idea to achieve good balance of load in the cluster. However, it comes with the cost of increased memory consumption and computation overhead as well as network communication. In this paper, we present a new definition of metric to model the cost of key splitting for intra-operator parallelism in stream processing systems and provide a novel perspective to reduce replication factor while keeping both overall load imbalance and processing latency low. Similar to previous work, our approach treats the head and the tail of the distribution differently in order to reduce memory requirements. For the head, it uses our proposed notion of regional load imbalance to decide dynamically whether to make one more worker responsible for the heavy hitter or not. For the tail, it simply uses hash partitioning to keep the size of the routing table for the head as small as possible. Extensive experimental evaluation demonstrates that our approach provides superior performance compared to the state-of-the-art partitioning algorithms in terms of load imbalance, replication factor and latency over different levels of skewed stream distributions.

关键词： Partitioning algorithms Memory management Measurement parallel processing Microsoft Windows Load modeling throughput

来源：评论

学校读者我要写书评

暂无评论

HAMS: heterogeneous asynchronous multi-source streaming protocol to realize scalable multimedia communications

HAMS: heterogeneous asynchronous multi-source streaming prot...

引用

international conference on Advanced Information Networking and Applications (AINA)

作者： S. Itaya N. Hayashibara T. Enokido M. Takizawa Department of Computers and Systems Engineering Tokyo Denki University Japan Faculty of Business Administration Rissho University Japan

In a peer-to-peer (P2P) overlay network, a large number and various types of peers are cooperating by exchanging multimedia contents. Here, multimedia streaming is a key technology to realize multimedia applications. A multimedia content is distributed to multiple peers and these peers named contents peers can support other leaf peers with the content. Multimedia contents are required to be efficiently delivered to processes in a real-time manner. Some contents peer may not send packets at a required rate and a communication channel may not support enough quality of service (QoS). In this paper, we newly discuss a heterogeneous asynchronous multi-source streaming (HAMS) model where multiple contents peers in parallel transmit packets of a multimedia content to a requesting leaf peer to realize highly reliability and scalability.

关键词： Streaming media Protocols Multimedia communication Multimedia systems Peer to peer computing Quality of service Computer networks Communication channels Scalability Motion pictures

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共31页 << < 22 23 24 25 26 27 28 29 30 31 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：