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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

269 篇 会议
7 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

138 篇 工学
- 129 篇 计算机科学与技术...
- 75 篇 软件工程
- 37 篇 电气工程
- 9 篇 电子科学与技术（可...
- 9 篇 控制科学与工程
- 7 篇 信息与通信工程
- 6 篇 机械工程
- 2 篇 光学工程
- 2 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
- 2 篇 网络空间安全
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 纺织科学与工程
25 篇 理学
- 16 篇 数学
- 6 篇 物理学
- 5 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 生物学
24 篇 管理学
- 15 篇 管理科学与工程(可...
- 11 篇 图书情报与档案管...
- 8 篇 工商管理
3 篇 经济学
- 3 篇 应用经济学
3 篇 农学
- 3 篇 作物学
2 篇 法学
- 1 篇 法学
- 1 篇 社会学
1 篇 医学

主题

30 篇 peer to peer com...
26 篇 servers
21 篇 cloud computing
20 篇 parallel process...
19 篇 algorithm design...
19 篇 distributed comp...
18 篇 concurrent compu...
14 篇 computer archite...
13 篇 processor schedu...
13 篇 computational mo...
12 篇 bandwidth
12 篇 resource managem...
12 篇 protocols
12 篇 delay
11 篇 application soft...
11 篇 high performance...
10 篇 scalability
10 篇 routing
10 篇 streaming media
9 篇 hardware

机构

4 篇 equipe runtime i...
4 篇 equipe hiepacs i...
4 篇 institute of com...
3 篇 china univ geosc...
2 篇 institute of inf...
2 篇 pervasive techno...
2 篇 icar-cnr napoli
2 篇 school of comput...
2 篇 karlsruhe inst t...
2 篇 department of co...
2 篇 brookhaven natl ...
2 篇 computer science...
2 篇 natl univ def te...
2 篇 university of st...
2 篇 department of en...
2 篇 second universit...
2 篇 indiana univ per...
2 篇 shenzhen institu...
2 篇 department of co...
2 篇 univ texas dept ...

作者

4 篇 jean roman
4 篇 emmanuel jeannot
4 篇 raymond namyst
3 篇 lizhe wang
3 篇 wang lizhe
2 篇 sens pierre
2 篇 jesper larsson t...
2 篇 michael alexande...
2 篇 feng wu-chun
2 篇 divitini monica
2 篇 sergio bernabe
2 篇 pinki pinki
2 篇 huang bormin
2 篇 li chen
2 篇 wang d
2 篇 nagalingam sv
2 篇 gianni francesco
2 篇 wang yijie
2 篇 tao jie
2 篇 ernst m.

语言

279 篇 英文
1 篇 其他
1 篇 中文

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

共 281 条记录，以下是161-170 订阅

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

详细简洁

排序：

Peer Content Groups for Reliable and Transparent Content Access in P2P Networks

Peer Content Groups for Reliable and Transparent Content Acc...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Ana Fl´via B. Godoi Elias P. Duarte Jr. Department of Computer Science Federal University of Paraná (UFPR) Curitiba Brazil

this work presents a strategy based on the group communication for transparent and robust content access in P2P networks. Instead of accessing a single peer for obtaining the desired content, a user request is received and processed by a group of peers. A Peer Content Group (PCG) guarantees continuous access to content even if members crash or leave the system provided at least one member remains fault-free. Each PCG member is capable of independently serving the request. A PCG is transparent to the user, as the group interface is identical to the interface provided by a single peer. A group member is elected to serve each request. A fault monitoring component allows the detection of member crashes. If the peer that is serving a request crashes, another group member is elected to continue providing the service. Peer election and replacement are transparent to client peers. the PCG and a P2P file sharing application were implemented in the JXTA platform. Experimental results are presented showing the latency of group operations and system components.

关键词： Servers Peer to peer computing Nominations and elections Computer crashes Heart beat Protocols Heart rate variability

来源：评论

学校读者我要写书评

暂无评论

Data Collection with Multiple Controlled Mobile Nodes in Wireless Sensor Networks

Data Collection with Multiple Controlled Mobile Nodes in Wir...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Chao Wang Huadong Ma Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

Data collection is a fundamental and important issue in wireless sensor networks. Recent research has shown that using mobile nodes to collect and carry data in WSNs has many advantages over static multi-hop routing. In this paper, we focus on the problem of reducing the number of mobile nodes require by data collection in WSNs. Each mobile node visits the sensor nodes, that assigned to it, every t seconds to pick up the cached data. the data gathered by mobile nodes far away from the base station are transferred to the base station through mobile nodes closer to the base station. We formally prove that the problem of data collection in WSNs with the minimum mobile nodes is NP hard. In order to reduce the number of mobile nodes, We propose two algorithms. One tries to reduce the number of mobile nodes and optimize their travel paths, and the other one carefully schedules the movement of all mobile nodes to make sure that they can cooperate with each other to transfer all gathered data to the base station. Our simulation results show that our approach can notably reduce the number of required mobile nodes as much as 46%.

关键词： Mobile communication Base stations Mobile computing Wireless sensor networks Monitoring Routing Sensors

来源：评论

学校读者我要写书评

暂无评论

Automatic FFT Performance Tuning on OpenCL GPUs

Automatic FFT Performance Tuning on OpenCL GPUs

引用

international conference on parallel and distributed systems (ICPADS)

作者： Yan Li Yunquan Zhang Haipeng Jia Guoping Long Ke Wang Laboratory of Parallel Software and Computational Science Institute of Software State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Information Science and Engineering Ocean University of China Qingdao China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China

Many fields of science and engineering, such as astronomy, medical imaging, seismology and spectroscopy, have been revolutionized by Fourier methods. the fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. the emerging class of high performance computing architectures, such as GPU, seeks to achieve much higher performance and efficiency by exposing a hierarchy of distinct memories to programmers. However, the complexity of GPU programming poses a significant challenge for programmers. In this paper, based on the Kronecker product form multi-dimensional FFTs, we propose an automatic performance tuning framework for various OpenCL GPUs. Several key techniques of GPU programming on AMD and NVIDIA GPUs are also identified. Our OpenCL FFT library achieves up to 1.5 to 4 times, 1.5 to 40 times and 1.4 times the performance of clAmdFft 1.0 for 1D, 2D and 3D FFT respectively on an AMD GPU, and the overall performance is within 90% of CUFFT 4.0 on two NVIDIA GPUs.

关键词： Graphics processing unit Instruction sets Vectors Memory management Kernel Programming

来源：评论

学校读者我要写书评

暂无评论

引用

international conference on parallel and distributed systems (ICPADS)

作者： Hung-Yi Teng Chien-Nan Lin Ren-Hung Hwang Department of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan

Unstructured peer-to-peer (P2P) systems with two-layer hierarchy, comprising an upper layer of super-peers and an underlying layer of ordinary peers, are used to improve the performance of large-scale P2P systems. In order to deal with continuous growth of participating peers, a scalable super-peer overlay topology with a lower diameter is essential. However, there is relatively little research conducted on constructing a scalable super-peer overlay topology. In the existing solutions, the number of connections that super-peers need to maintain is in direct proportion to the total number of super-peers which makes the solutions not scalable as well as not practical. therefore, in this paper, we propose a scalable hierarchical unstructured P2P system which using a self-similar square network graph (SSNG) to construct and maintain the super-peer overlay topology dynamically. Moreover, a forwarding mechanism over SSNG is presented to enable each super-peer to receive just one flooding message. the analytical results show that the proposed SSNG-based overlay is more scalable and efficient than the perfect difference graph (PDG)-based overlay proposed in the literature.

关键词： Peer to peer computing Topology Servers Network topology Delay Algorithm design and analysis Indexes

来源：评论

学校读者我要写书评

暂无评论

Optimization of Sparse Matrix-Vector Multiplication with Variant CSR on GPUs

Optimization of Sparse Matrix-Vector Multiplication with Var...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Xiaowen Feng Hai Jin Ran Zheng Kan Hu Jingxiang Zeng Zhiyuan Shao Services Computing Technology and System Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Sparse Matrix-Vector multiplication (SpMV) is one of the most significant yet challenging issues in computational science area. It is a memory-bound application whose performance mostly depends on the input matrix and the underlying architecture. Many researchers have paid more attentions on exploring a variety of optimization techniques to SpMV. One of the most promising respects is how to adapt the storage format to satisfy the underlying architecture. Alterative storage formats can largely lessen memory pressure, however, the computational resources are often underutilized. therefore, a new storage format, which is called Compressed Sparse Row with Segmented Interleave Combination (SIC), is proposed. Stemming from Compressed Sparse Row format (CSR), SIC format employs an interleave combination pattern that combines certain amount of CSR rows to form a new SIC row. In order to further improve performance, segmented processing is also brought in. According to the empirical data, we also develop an automatic SIC-based SpMV suitable for all the matrices. Experimental results show that our approach outperforms the NVIDIA CSR vector kernel, achieving up to 12.6 × speedup. It also demonstrates a comparable performance with the Hybrid format, even with the highest 2.89 × speedup.

关键词： Graphics processing unit Kernel Sparse matrices Silicon carbide Vectors Instruction sets Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Broadcasting on Large Scale Heterogeneous Platforms with Connectivity Artifacts under the Bounded Multi-port Model

Broadcasting on Large Scale Heterogeneous Platforms with Con...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Olivier Beaumont Nicolas Bonichon Lionel Eyraud-Dubois Przemyslaw Uznanski INRIA Bordeaux-Sud-Ouest University of Bordeaux Bordeaux France

We consider the classical problem of broadcasting a large message at an optimal rate in a large scale distributed network. the main novelty of our approach is that we consider that the set of participating nodes can be split into two parts: "green" nodes that stay in the open-Internet and "red" nodes that lie behind firewalls or NATs. Two red nodes cannot communicate directly, but rather need to use a green node as a gateway for transmitting a message. In this context, we are interested in both maximizing the throughput (i.e. the rate at which nodes receive the message) and minimizing the degree at the participating nodes, i.e. the number of TCP connections they must handle simultaneously. We consider both cyclic and a cyclic solutions for the flow graph. In the cyclic case, our main contributions are a closed form formula for the optimal cyclic throughput and the proof that the optimal solution may require arbitrarily large degrees. In the a cyclic case, we propose an algorithm to achieve the optimal throughput with low degree. then, we prove a worst case ratio between the optimal a cyclic and cyclic throughput and show through simulations that this ratio is on average very close to 1, which makes a cyclic solutions efficient both in terms of throughput and of number of connections.

关键词： Bandwidth throughput Feeds Peer to peer computing Context Internet Quality of service

来源：评论

学校读者我要写书评

暂无评论

How Helpful Can Social Network Friends Be in Peer-to-Peer Video Distribution?

How Helpful Can Social Network Friends Be in Peer-to-Peer Vi...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Maria Luisa Merani Department of Information Engineering University of Modena and Reggio Emilia Modena Italy

Today two keywords more and more frequently recur over the Internet: Peer-to-Peer (P2P) and social networks. P2P, in all of its different declinations, represents a widely-adopted approach for content distribution, particularly for video diffusion. In parallel, the proliferation of social networks is an analogously stunning phenomenon, of unprecedented popularity and scope. In the present work we examine a mesh-based P2P overlay, specifically designed for video streaming, and put forth some modifications to the neighborhood creation and chunk scheduling algorithm the platform adopts, with the goal of favoring peers belonging to a social network and granting them better performance. the improvements that such modifications attain are measured in terms of delivery ratio (throughput) and playback delay. We find that it is possible to guarantee a clear service differentiation, so that social network peers experience an improved viewing experience at the expense of ordinary overlay members, and that the scheduling mechanism modifications warrant the more consistent gains, we also show the role that different percentages of peers belonging to the social network have on the considered metrics. We finally suggest that the attained differentiated service level can be leveraged as an incentive to convince peers of the video overlay to join the social network.

关键词： Peer to peer computing Social network services Streaming media Delay Communities Scheduling algorithm Proposals

来源：评论

学校读者我要写书评

暂无评论

A Batch Join Scheme for Flash Crowd Reduction in IPTV systems

A Batch Join Scheme for Flash Crowd Reduction in IPTV System...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Tein Yaw Chung Odin Lin Department of Computer Science and Engineering Yuan Ze University Taoyuan Taiwan

Peer-to-peer (P2P) streaming is an effective and popular approach for large scale television multicasting over Internet. However, it is always a major challenge when thousands of peers join a popular P2P IPTV channel in a short time, so called the problem of flash crowd. When the problem occurs, a large number of users suffer from large latency in joining a channel and even get blocked. In the past, rare studies are focused on the flash crowd issue. In this paper, we identify several key factors that may cause the flash crowd problem: request congestion, stream congestion, control message, and maintenance overhead. Based on our analysis, we present a batch join scheme instead of processing new users one by one. Our batch join process also solves the problem of current join processes that only use existing active peers to serve new users. We generate a virtual sub tee based purely on a batch of new peers which is then connected to an active peer server. Simulation results demonstrate that our batch join scheme significantly mitigate the flash crowd situation. Moreover, both of the peer blocking rate and re-join times are significant reduced.

关键词： Peer to peer computing Servers Bandwidth Streaming media IPTV Topology Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Cooperative Approach to Cache Consistency Maintenance in Wireless Mesh Networks

A Cooperative Approach to Cache Consistency Maintenance in W...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Wenzheng Xu Weigang Wu Hejun Wu Jiannong Cao Department of Computer Science Sun Yat-Sen University Guangzhou China Department of Computing The Hong Kong Polytechnic University Hong Kong China

Cooperative caching is especially desirable for multi-hop wireless networks to achieve efficient data access. Existing cooperative caching algorithms for wireless networks mostly focus on cache placement. Another key issue, cache consistency maintenance has not been adequately addressed. In this paper, we propose the first cooperative approach to maintain cache consistency for wireless mesh networks. It basically combines push and pull by making use of the hierarchical architecture of mesh networks. More precisely, we propose two techniques introducing cooperation among network nodes in delivering Invalidation Reports (IR) so as to reduce communication cost and tolerate message losses: IR integration buffers and integrates IRs at the gateway nodes and periodically broadcasts them, Cooperative IR re-sending lets the intermediate nodes resend missed IR messages upon request. the most challenging issue in our design is the determination of the optimal IR broadcast period in order to achieve the optimal tradeoff between push and pull. We conduct numerical analysis to get optimal values for different scenarios. Simulation results confirm our analysis well and comparisons with existing approaches show that our approach can save message cost significantly (50%-70%).

关键词： Logic gates Maintenance engineering Broadcasting Servers Internet Wireless networks Mobile communication

来源：评论

学校读者我要写书评

暂无评论

Service Availability for P2P On-Demand Streaming with Dynamic Buffering

Service Availability for P2P On-Demand Streaming with Dynami...

引用

international conference on parallel and distributed systems (ICPADS)

作者： Chow-Sing Lin Meng-Jia Yan Department of Computer Science and Information Engineering National University of Tainan Tainan Taiwan

In general, on-demand video services enable clients to watch videos from beginning to end. As long as clients are able to buffer the initial part of the video they are watching, on-demand service can provide access to the video to the next clients who request to watch it. In our previous research work, we proposed a novel caching scheme for peer-to-peer on-demand streaming, called Dynamic Buffering. the dynamic buffering relies on the feature of Multiple Description Coding to gradually reduce the number of cached descriptions held in a peer's buffers once the buffer is full. In this paper, we proposed three description dropping policies for dynamic buffering, called sequence dropping, m-dropping, and binary dropping. Mathematical formulas of the reduced number of buffer adjustments of descriptions and the reduction of the average number of selectable descriptions for m-dropping and binary dropping by factors of n and m were established in the paper. Experimental results showed that the m-dropping, m=[n/2] generally outperformed m-dropping, m=2 and binary dropping in terms of service availability. Even though the accumulated reduction of buffer adjustments for m-dropping polices was less than that for binary dropping, the average number of selectable descriptions for m-dropping was much greater than that for binary dropping.

关键词： Streaming media Availability Relays Encoding Servers Bandwidth Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：