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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

482 篇 会议
4 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

298 篇 工学
- 289 篇 计算机科学与技术...
- 165 篇 软件工程
- 94 篇 信息与通信工程
- 38 篇 电气工程
- 26 篇 电子科学与技术（可...
- 20 篇 控制科学与工程
- 12 篇 机械工程
- 9 篇 建筑学
- 7 篇 动力工程及工程热...
- 5 篇 土木工程
- 4 篇 力学（可授工学、理...
- 4 篇 测绘科学与技术
- 3 篇 光学工程
- 3 篇 化学工程与技术
- 3 篇 航空宇航科学与技...
- 3 篇 农业工程
- 3 篇 生物工程
112 篇 理学
- 96 篇 数学
- 14 篇 统计学（可授理学、...
- 12 篇 系统科学
- 9 篇 物理学
- 7 篇 生物学
- 5 篇 化学
- 3 篇 地球物理学
62 篇 管理学
- 43 篇 管理科学与工程(可...
- 38 篇 工商管理
- 21 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 3 篇 法学
5 篇 文学
- 5 篇 新闻传播学
3 篇 农学
2 篇 教育学
1 篇 医学
1 篇 军事学

主题

111 篇 distributed comp...
69 篇 computer network...
54 篇 concurrent compu...
43 篇 grid computing
38 篇 distributed comp...
37 篇 peer to peer com...
36 篇 intelligent netw...
36 篇 artificial intel...
35 篇 software enginee...
30 篇 parallel process...
30 篇 computer archite...
27 篇 application soft...
26 篇 computer science
25 篇 parallel process...
24 篇 delay
20 篇 scalability
18 篇 routing
18 篇 bandwidth
17 篇 costs
16 篇 network servers

机构

5 篇 institute of com...
3 篇 chinese academy ...
3 篇 school of comput...
3 篇 institute of com...
2 篇 department of co...
2 篇 department of in...
2 篇 school of comput...
2 篇 the leslie and s...
2 篇 school of comput...
2 篇 univ valencia ir...
2 篇 national laborat...
2 篇 graduate univers...
2 篇 college of infor...
2 篇 department of co...
2 篇 national key lab...
2 篇 seikei universit...
2 篇 department of co...
2 篇 chinese academy ...
2 篇 univ catania dep...
2 篇 china mobile com...

作者

5 篇 mikkilineni rao
4 篇 morana giovanni
3 篇 messina fabrizio
3 篇 huaikou miao
3 篇 engelmann christ...
3 篇 sungwon kang
2 篇 choi k.
2 篇 yongquan fu
2 篇 lo re giuseppe
2 篇 kodama eiichiro
2 篇 brzezinski krzys...
2 篇 dongsheng li
2 篇 guangyu shi
2 篇 shietung peng
2 篇 satoshi fujita
2 篇 hao gong
2 篇 ming-chien yang
2 篇 pawaskar sachin
2 篇 alias norma
2 篇 yijie wang

语言

488 篇 英文

检索条件"任意字段=IASTED International Conference on Parallel and Distributed Computing and Networks, PDCN 2009"

共 488 条记录，以下是481-490 订阅

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

详细简洁

排序：

HiFiP2P: The Simulator Capable of Massive Nodes and Measured Underlay

HiFiP2P: The Simulator Capable of Massive Nodes and Measured...

引用

Euromicro conference on parallel, distributed and Network-Based Processing

作者： Guangyu Shi Youshui Long Hao Gong Changqing Wan Chuanliang Yu Xianqing Yang Hongli Zhang Yunfei Zhang Huawei Technologies Corporation Limited Shenzhen China Harbin Institute of Technology Harbin China China Mobile Communications Company Beijing China

Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today's Internet traffic. They have recently absorbed a lot of attention from the Internet users and the research community. Regarding the difficulty and cost for a large scale living deployment, many proposed P2P protocols were evaluated by a simulator. However, most of current P2P simulators have common draw backs including the poor scalability with massive simulated peers and the lack of realistic underlay network layer support. Unfortunately, those functionalities are critical to understand how a P2P protocol would be-have in the real circumstance. In this paper, we present some approaches to overcome such defects, and the design considerations of HiFiP2P, our novel large-scale parallel peer-to-peer simulator with a measured realistic Internet data as its network layer support. Comparison experiments show that HiFiP2P simulator outperforms the existing simulation platform J-Sim & PlanetSim in both aspects of scalability and efficiency.

关键词： Peer to peer computing Internet Extraterrestrial measurements Large-scale systems Protocols Scalability Routing Traffic control Costs IP networks

来源：评论

学校读者我要写书评

暂无评论

Running parallel Applications with Topology-Aware Grid Middleware

Running Parallel Applications with Topology-Aware Grid Middl...

引用

IEEE international conference on e-Science and Grid computing

作者： Pavel Bar Camille Coti Derek Groen Thomas Herault Valentin Kravtsov Assaf Schuster Martin Swain Technion-Israel Institute of Technology Haifa Israel INRIA-Saclay Île-de-France Orsay France Section Computational Science University of Amsterdam Amsterdam Netherlands University of Ulster UK

The concept of topology-aware grid applications is derived from parallelized computational models of complex systems that are executed on heterogeneous resources, either because they require specialized hardware for certain calculations, or because their parallelization is flexible enough to exploit such resources. Here we describe two such applications, a multi-body simulation of stellar evolution, and an evolutionary algorithm that is used for reverse-engineering gene regulatory networks. We then describe the topology-aware middleware we have developed to facilitate the "modeling-implementing-executing" cycle of complex systems applications. The developed middleware allows topology-aware simulations to run on geographically distributed clusters with or without firewalls between them. Additionally, we describe advanced coallocation and scheduling techniques that take into account the applications topologies. Results are given based on running the topology-aware applications on the Grid'5000 infrastructure.

关键词： Middleware Computational modeling Evolutionary computation Biological system modeling Concurrent computing Grid computing Topology Collaboration Genetics Cities and towns

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of a Python implementation of the new LEDBAT congestion control algorithm

Performance evaluation of a Python implementation of the new...

引用

IEEE international conference on Automation, Quality and Testing, Robotics, AQTR

作者： Mugurel Ionuţ Andreica Nicolae Ţăpuş Johan Pouwelse Computer Science Department Politehnica University of Bucharest Romania Parallel and Distributed Systems Group Delft University of Technology Netherlands

LEDBAT is a new congestion control algorithm which was proposed in an IETF draft in March 2009. LEDBAT's goal is to provide a less-than-best-effort data transport service, i.e. a LEDBAT flow should back-off in the presence of other competing flows (TCP flows in particular). Because of its intended friendliness to competing flows, LEDBAT has already been implemented in the popular Bittorrent client uTorrent. In this paper we present performance evaluation results for our Python implementation of LEDBAT. We ran tests both in emulated networks as well as in real world networks. One of the tests involved approximately 300 volunteers spread throughout the world.

关键词： Peer to peer computing Testing Control systems Delay estimation Delay effects Streaming media Computer science Radio access networks Performance evaluation Time measurement

来源：评论

学校读者我要写书评

暂无评论

All-to-All Personalized Exchange Algorithms in Generalized Shuffle-Exchange networks

All-to-All Personalized Exchange Algorithms in Generalized S...

引用

international conference on Networking (ICN)

作者： Well Y. Chou Richard B. Chen Chiuyuan Chen Department of Applied Mathematics National Chiao Tung University Hsinchu Taiwan

All-to-all personalized exchange (ATAPE) occurs in many parallel applications. Previous ATAPE algorithms were mainly developed for hypercube, mesh, and torus networks. Recently, Yang and Wang and also Massini proposed an alternative approach to ATAPE by using multistage interconnection networks (MINs); they proposed new ATAPE algorithms for a class of unique-path, self-routable MINs (for example, baseline, shuffle-exchange (or omega), banyan network, and the reverse networks of these networks). However, the algorithms in and require that the given MIN must have unique-path property and satisfy N = 2n, in which N is the number of inputs (outputs) and n is the number of stages in the MIN. In Padmanabhan proposed the generalized shuffle-exchange network (GSEN), which allows N to be any even number. Since the GSEN is not a unique-path MIN, the algorithms and do not work on it. The purpose of this paper is to consider ATAPE in MINs without unique-path properly. To our knowledge, no one has studied ATAPE in this type of MINs. We prove that under stage control technique, ATAPE algorithms for GSENs require at least 2 n rounds. We propose an algorithm which uses a variation of stage control and works for all N = 2 (mod 4). We will prove that our algorithm takes N rounds and therefore is optimal.

关键词： Switches Hypercubes Scalability Communication switching distributed computing Mathematics Multiprocessor interconnection networks Fast Fourier transforms Delay Broadcasting

来源：评论

学校读者我要写书评

暂无评论

Resource-efficient acceleration of 2-dimensional Fast Fourier Transform computations on FPGAs

Resource-efficient acceleration of 2-dimensional Fast Fourie...

引用

ACM/IEEE international conference on distributed Smart Cameras, ICDSC

作者： Hojin Kee Shuvra S. Bhattacharyya Newton Petersen Jacob Kornerup Department of Electrical and Computer Engineering University of Maryland College Park MD USA National Instruments Corporation Austin TX USA

The 2-dimensional (2D) fast Fourier transform (FFT) is a fundamental, computationally intensive function that is of broad relevance to distributed smart camera systems. In this paper, we develop a systematic method for improving the throughput of 2D-FFT implementations on field-programmable gate arrays (FPGAs). Our method is based on a novel loop unrolling technique for FFT implementation, which is extended from our recent work on FPGA architectures for 1D-FFT implementation. This unrolling technique deploys multiple processing units within a single 1D-FFT core to achieve efficient configurations of data parallelism while minimizing memory space requirements, and FPGA slice consumption. Furthermore, using our techniques for parallel processing within individual 1DFFT cores, the number of input/output (I/O) ports within a given 1D-FFT core is limited to one input port and one output port. In contrast, previous 2D-FFT design approaches require multiple I/O pairs with multiple FFT cores. This streamlining of 1D-FFT interfaces makes it possible to avoid complex interconnection networks and associated scheduling logic for connecting multiple I/O ports from 1D-FFT cores to the I/O channel of external memory devices. Hence, our proposed unrolling technique maximizes the ratio of the achieved throughput to the consumed FPGA resources under pre-defined constraints on I/O channel bandwidth. To provide generality, our framework for 2D-FFT implementation can be efficiently parameterized in terms of key design parameters such as the transform size and I/O data word length.

关键词： Acceleration Fast Fourier transforms Field programmable gate arrays Throughput parallel processing distributed computing Smart cameras Multiprocessor interconnection networks Logic devices Joining processes

来源：评论

学校读者我要写书评

暂无评论

Models for P2P Multi-Source Streaming

Models for P2P Multi-Source Streaming

引用

international conference on Complex, Intelligent and Software Intensive Systems, CISIS

作者： Alireza Goudarzi Nemati Tomoya Enokido Makoto Takizawa Seikei University Japan Rissho University Japan

ISBN: (纸本)9781424435692

In peer-to-peer (P2P) overlay networks, multimedia objects are distributed in peers and source peers transmit a multimedia object to receiver peers. In this paper, we would like to discuss how multiples source peers deliver multimedia objects to receiver peers in a streaming model so that enough quality of service (QoS) required is supported in presence of QoS change. A multimedia object is realized in a sequence of primitive objects which are units of transmission at the P2P overlay layer. The receiver peer is required to receive primitive objects of the multimedia object with enough QoS, e.g. no primitive object loss. We discuss types of multi-source streaming (MSS) models where a receiver peer can receive primitive objects of a multimedia object from multiple source peers which can support enough *** are serial and parallel types of MSS models. In the serial MSS model, a receiver peer receives each primitive object from one of the source peers at a time. If a current source peer is expected to support lower QoS than required or not to support a succeeding primitive object, another source peer starts sending primitive objects. In the parallel MSS model, multiple source peers in parallel send primitive object units to the receiver peer. A primitive object is redundantly sent by multiple source peers or non-redundantly sent by a source peer. Here the throughput and reliability can be increased.

关键词： Peer to peer computing Streaming media Quality of service Multimedia systems Switches Intelligent networks Competitive intelligence Software systems Throughput Data communication

来源：评论

学校读者我要写书评

暂无评论

Transmission Scheduling in Data-Driven Peer-to-Peer Streaming towards Optimal Throughput

Transmission Scheduling in Data-Driven Peer-to-Peer Streamin...

引用

international conference on Networking, Architecture, and Storage (NAS)

作者： Jiqing Wu Yuxing Peng Feng Liu National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

Peer-to-peer media streaming has been an important service on the internet in recent years. The Data-driven (or mesh-based) structure is adopted by most working systems,in which data scheduling is one of the important ***, those frequently used scheduling algorithms are often faced with such a case: A neighbor peer takes up its bandwidth to deliver the packets that other neighbors can also supply, but some packets only held by it are not *** packets can not be delivered in the current scheduling cycle, even though that the other neighbors have surplus bandwidth. This is a kind of waste of bandwidth and decreases the throughput of transmission. In this paper we propose anew scheduling algorithm aiming at the optimal throughput:Bipartite-matching based Block Scheduling algorithm(BBS).We convert the original data scheduling problem to a problem of finding a maximum match on the correspond bipartite graph, then assign data packets to neighbors according to the maximum match. We evaluate the performance of BBS with extensive experiments and the results show that BBS throughput and provides better streaming quality than those frequently used scheduling algorithms.

关键词： Peer to peer computing Throughput Bandwidth Scheduling algorithm Streaming media Laboratories distributed processing IP networks Web and internet services Bipartite graph

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of bandwidth-inhomogeneous swarms in BitTorrent

Modeling and analysis of bandwidth-inhomogeneous swarms in B...

引用

international conference on Peer-to-Peer computing

作者： M. Meulpolder J. A. Pouwelse D. H. J. Epema H. J. Sips Parallel and Distributed Systems Group Department of Computer Science Delft University of Technnology Netherlands

ISBN: (纸本)9781424450664

A number of analytical models exists that capture various properties of the BitTorrent protocol. However, until now virtually all of these models have been based on the assumption that the peers in the system have homogeneous bandwidths. As this is highly unrealistic in real swarms, these models have very limited applicability. Most of all, these models implicitly ignore BitTorrent's most important property: peer selection based on the highest rate of reciprocity. As a result, these models are not suitable for understanding or predicting the properties of real BitTorrent networks. Furthermore, they are hardly of use in the design of realistic BitTorrent simulators and new P2P protocols. In this paper, we extend existing work by presenting a model of a swarm in BitTorrent where peers have arbitrary upload and download bandwidths. In our model we group peers with (roughly) the same bandwidth in classes, and then analyze the allocation of upload slots from peers in one class to peers in another class. We show that our model accurately predicts the bandwidth clustering phenomenon observed experimentally in other work, and we analyze the resulting data distribution in swarms. We validate our model with experiments using real BitTorrent clients. Our model captures the effects of BitTorrent's well-known `tit-for-tat' mechanism in bandwidth-inhomogeneous swarms and provides an accurate mathematical description of the resulting dynamics.

关键词： Bandwidth Protocols Predictive models Mathematical model Peer to peer computing Computer science Internet Mechanical factors Fluid dynamics Analytical models

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 40 41 42 43 44 45 46 47 48 49 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：