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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

463 篇 会议
26 册 图书
17 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

282 篇 工学
- 267 篇 计算机科学与技术...
- 113 篇 软件工程
- 33 篇 信息与通信工程
- 30 篇 电气工程
- 16 篇 控制科学与工程
- 12 篇 电子科学与技术（可...
- 7 篇 机械工程
- 5 篇 力学（可授工学、理...
- 5 篇 生物医学工程（可授...
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 4 篇 网络空间安全
- 3 篇 材料科学与工程（可...
- 3 篇 动力工程及工程热...
- 3 篇 建筑学
- 3 篇 交通运输工程
76 篇 理学
- 58 篇 数学
- 12 篇 系统科学
- 10 篇 物理学
- 8 篇 生物学
- 7 篇 统计学（可授理学、...
41 篇 管理学
- 25 篇 管理科学与工程(可...
- 17 篇 工商管理
- 16 篇 图书情报与档案管...
10 篇 医学
- 7 篇 临床医学
- 4 篇 基础医学(可授医学...
- 3 篇 公共卫生与预防医...
5 篇 经济学
- 5 篇 应用经济学
4 篇 法学
- 4 篇 社会学
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

63 篇 concurrent compu...
60 篇 distributed comp...
53 篇 parallel process...
35 篇 parallel algorit...
31 篇 computer science
31 篇 application soft...
30 篇 computer archite...
28 篇 hardware
28 篇 computer network...
22 篇 computational mo...
21 篇 message passing
20 篇 parallel process...
20 篇 high performance...
19 篇 costs
18 篇 grid computing
18 篇 workstations
18 篇 delay
17 篇 distributed comp...
16 篇 parallel program...
14 篇 bandwidth

机构

5 篇 department of co...
3 篇 syracuse univ sy...
3 篇 polytechnic univ...
3 篇 harbin institute...
3 篇 peking universit...
3 篇 department of co...
2 篇 université jean ...
2 篇 enea headquarter...
2 篇 leibniz universi...
2 篇 department of co...
2 篇 int comp sci ins...
2 篇 georgia inst tec...
2 篇 univ paderborn d...
2 篇 gte laboratories...
2 篇 ruhr university ...
2 篇 department of co...
2 篇 unicredit milan
2 篇 northwestern uni...
2 篇 mcgill universit...
2 篇 upc barcelonatec...

作者

5 篇 a. choudhary
4 篇 yongqiang sun
3 篇 priya unnikrishn...
3 篇 meyerhenke henni...
3 篇 babik marian
3 篇 kit barton
3 篇 hluchy ladislav
3 篇 sun yq
3 篇 xinda lu
3 篇 s. hariri
2 篇 davies a.j.
2 篇 ibéria medeiros
2 篇 r. fujimoto
2 篇 grover pulkit
2 篇 holger fröning
2 篇 to-yat cheung
2 篇 pascal welke
2 篇 linara adilova
2 篇 sauerwald thomas
2 篇 g. allen

语言

499 篇 英文
4 篇 中文
2 篇 其他
1 篇 西班牙文

检索条件"任意字段=Proceedings of the Advances in Parallel and Distributed Computing"

共 506 条记录，以下是101-110 订阅

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

详细简洁

排序：

A concurrent multi target tracker: Benchmarking and portability

A concurrent multi target tracker: Benchmarking and portabil...

引用

23rd International Conference on parallel Processing, ICPP 1994

作者： Hariri, Salim Yadav, Rajesh Thiagarajan, Balaji Park, Sung-Yong Subramanyan, Mahesh Reddy, Rajashekar Fox, G.C. Northeast Parallel Architectures Center Department of Electrical and Computer Engineering Syracuse University Syracuse NY 13244 United States

With the current advances in computing and network technology and software, the gap between parallel and distributed computing environment is gradually becoming narrower. Consequently, parallel programs run on parallel as well as distributed systems. However, programming and porting complex applications to such environment is challenging task and not well understood. In this paper, we use a concurrent multi target tracker as a running example to analyze and evaluate performance of two different parallel implementations on parallel and distributed systems. We have benchmarked both these implementations on different architectures that vary from a network of workstations(SUN, IBM RS6000) to parallel computers (CM5, iPSC 860) using different parallel/distributed message passing tools(PVM, p4, EXPRESS). © 1994 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Data allocation in mobile computing: A project description

Data allocation in mobile computing: A project description

引用

1993 IEEE Workshop on advances in parallel and distributed Systems, APADS 1993

作者： Wolfson, O. Department of Electrical Engineering and Computer Science University of Illinois ChicagoIL60680 United States

ISBN: (纸本)0818652500

Users of mobile computers will soon have access to shared online databases via wireless networks. The authors are developing a system that dynamically allocates and deallocates copies of the data-items in these databases to mobile computers, for optimizing cost and performance. This dynamic allocation of data-items to mobile computers is guided by input from the users concerning the type of wireless network, overall system reliability and availability requirements, and the objective function to be optimized. © 1993 IEEE.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Market-based massively parallel Internet computing 3

Market-based massively parallel Internet computing

引用

3rd Working Conference on Massively parallel Programming Models (MPPM97)

作者： Cappello, P Christiansen, BO Neary, MO Schauser, KE Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)0818684275

Recent advances in Internet connectivity and implementations of safer distributed computing through languages such as Java provide the foundation for transforming computing resources into tradable commodities. We have developed Javelin, a Java-based prototype of a globally distributed heterogeneous, high-performance computational infrastructure that conveniently enables rapid execution of massively parallel applications. Our infrastructure consists of three entities: Hosts, clients, and brokers. Our goal is to allow users to buy and sell computational power using supply and demand, and market mechanisms to marshal computational power far beyond what can be achieved via conventional techniques. Several research issues must be worked out to make this vision a reality: allocating resources between computational objects via market mechanisms;expressing and enforcing scheduling and quality of service constraints;modeling programming in a global computing ecosystem;supporting heterogeneous execution without sacrificing computational speed;ensuring host security;global naming and communication;and client privacy.

关键词： Commerce

来源：评论

学校读者我要写书评

暂无评论

A Service Path Selection and Adaptation Algorithm in Service-Oriented Network Virtualization Architecture

A Service Path Selection and Adaptation Algorithm in Service...

引用

19th IEEE International Conference on parallel and distributed Systems (ICPADS)

作者： Lee, Kwonyong Yoon, Haerim Park, Sungyong Sogang Univ Dept Comp Sci & Engn Seoul South Korea

ISBN: (纸本)9781479920815

With the advances of networking and cloud computing technologies, many web services are often implemented as cloud services by different service providers, and some SPs compose those services to create an end-to-end network service. In this service-oriented network virtualization environment, two important but somehow contradictory technical challenges are 1) how to select an optimal service path in order to meet the QoS requirements by users, and 2) how to balance the loads to fully utilize the whole systems. In this paper, we present an adaptive service path selection algorithm in service-oriented network virtualization environment, which assures QoS and balances the load at the same time. The proposed algorithm selects appropriate component services from multiple candidate service instances running on virtual machines and creates an optimal service path satisfying the users' QoS requirements. Our algorithm also dynamically adapts to the optimal service path based on various changes. Since the proposed algorithm handles a variation of the multi-constrained path selection problem known as NP-complete, we formulate the problem using ant colony optimization algorithm. The experimental results show that our algorithm guarantees the maximal QoS to the users while balancing the load at the same time, and adapts to the optimal service path based on the situational changes.

关键词： service-oriented network virtualization cloud computing service overlay network service path selection adaptation QoS load balancing

来源：评论

学校读者我要写书评

暂无评论

ACCELERATING TRAFFIC MICROSIMULATIONS: A parallel DISCRETE-EVENT QUEUE-BASED APPROACH FOR SPEED AND SCALE

ACCELERATING TRAFFIC MICROSIMULATIONS: A PARALLEL DISCRETE-E...

引用

Winter Simulation Conference 2009

作者： Thulasidasan, Sunil Eidenbenz, Stephan Los Alamos Natl Lab Los Alamos NM 87545 USA

ISBN: (纸本)9781424457700

We present Fast Trans - a parallel, distributed-memory simulator for transportation networks that uses a queue-based event-driven approach to traffic microsimulation. Queue-based simulation models have been shown to be significantly faster than cellular-automata type approaches, sacrificing spatial granularity for speed, while preserving link and intersection dynamics with high fidelity. Significant advances over previous work include the size of the simulated network, support for dynamic responses to congestion and the absence of precomputed routes - all routing calculations are executed online. We present initial results from a scalability study using a real-world network from the North-East region of the United States comprising over 1.5 million network elements and over 25 million vehicular trips. Simulation of an entire day's worth of realistic vehicular itineraries involving approximately five billion simulated events executes in less than an hour of wall-clock time on a distributed computing cluster. Initial results suggest almost linear speed-ups with cluster size.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

Virtualization in parallel distributed computing

引用

12th European parallel-Virtual-Machine-and-Message-Passing-Interface-Users-Group Meeting (PVM/MPI)

作者： Sunderam, V Emory Univ Dept Math & Comp Sci Atlanta GA 30322 USA

ISBN: (纸本)3540290095

A decade and a half ago, the parallel Virtual Machine abstraction strived to virtualize a collection of heterogeneous components into a generalized concurrent computing resource. PVM presented a unified programming, model backed by runtime subsystems and scripts that homogenized machine dependencies. This paradigm has had mixed success when translated to computing environments that span multiple administrative and ownership domains. We argue that multidomain resource sharing is critically dependent upon decoupling provider concerns from client requirements, and suggest alternative methodologies for virtualizing heterogeneous resource aggregates. We present the H2O framework, a core subsystem in the Harness project, and discuss its alternative approach to metacomputing. H2O is based on a "pluggable" software architecture to enable flexible and reconfigurable distributed computing. A key feature is the provisioning of customization capabilities that permit clients to tailor provider resources as appropriate to the given application, without compromising control or security. Through the use of uploadable "pluglets", users can exploit specialized features of the underlying resource, application libraries, or optimized message passing subsystems on demand. The current status of the H2O system, recent experiences, and planned enhancements are described, in the context of evolutionary directions in virtualizing distributed resources. © Springer-Verlag Berlin Heidelberg 2005.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Complex Network Analysis on distributed Systems - An Empirical Comparison

Complex Network Analysis on Distributed Systems - An Empiric...

引用

IEEE/ACM International Conference on advances in Social Networks Analysis and Mining (ASONAM)

作者： Koch, Jannis Staudt, Christian L. Vogel, Maximilian Meyerhenke, Henning Karlsruhe Inst Technol KIT Fac Informat Fasanengarten 5 D-76131 Karlsruhe Germany

ISBN: (纸本)9781450338547

Complex networks are relational data sets commonly represented as graphs. The analysis of their intricate structure is relevant to many areas of science and commerce, and data sets may reach sizes that require distributed storage and processing. We describe and compare programming models for distributed computing with a focus on graph algorithms for large-scale complex network analysis. Four frameworks - GraphLab, Apache Giraph, Giraph++ and Apache Flink - are used to implement algorithms for the representative problems Connected Components, Community Detection, PageRank and Clustering Coefficients. The implementations are executed on a computer cluster to evaluate the frameworks' suitability in practice and to compare their performance to that of the single-machine, shared-memory parallel network analysis package NetworKit. Out of the distributed frameworks, GraphLab and Apache Giraph generally show the best performance. In our experiments a cluster of eight computers running Apache Giraph enables the analysis of a network with about 2 billion edges, which is too large for a single machine of the same type. However, for networks that fit into memory of one machine, the performance of the shared-memory parallel implementation is far better than the distributed ones. The study provides experimental evidence for selecting the appropriate framework depending on the task and data volume.

关键词： distributed computing graph algorithms complex networks

来源：评论

学校读者我要写书评

暂无评论

Recent advances in trusted grids and peer-to-peer computing systems

Recent advances in trusted grids and peer-to-peer computing ...

引用

21st International parallel and distributed Processing Symposium, IPDPS 2007

作者： Hwang, Kai University of Southern California Los Angeles CA 90089 United States Department of Electrical Engineering and Computer Science Internet and Grid Research Laboratory University of Southern California

ISBN: (纸本)1424409101

Computational Grids and peer-to-peer (P2P) are emerging as two of the most promising distributed computing technologies that may change the world in the next decade. In this talk, Dr. Hwang presents recent advances in network security technologies, cyber trust systems, and integrated solutions for trusted computing over the Internet. The talk covers the integration of web services with P2P Grid computing, new cybertrust models, Internet worm containment, P2P reputation systems, and hybrid defense systems to protect distributed resources from network worms, DDoS attacks or peer intrusions or collusions. Research findings and benchmark results from the USC GridSec project will be reported for automated trust management to facilitate security binding and defense against worms and DDoS attacks in Grids, P2P systems, and web services. He will assess frontier research topics on fast reputation aggregation for trusted P2P file sharing, security-aware Grid job scheduling, game-theoretic modeling of non-cooperative Grids, new performance metrics, and DETER experiments for cybertrust development. The fortified Grids, P2P systems, and Internet resources will benefit many security-sensitive applications in digital government, e-commerce, distance learning, distributed supercomputing, etc. ©2007 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Performance Improvement of Read Operations in distributed File System Through Anticipated parallel Processing 2nd

Performance Improvement of Read Operations in Distributed Fi...

引用

2nd International Conference on Computer and Communication Technologies

作者： Rangaswamy, B. Geethanjali, N. Ragunathan, T. Kumar, B. Sudheer Prosoft Resources Pvt Ltd Hyderabad Andhra Pradesh India Sri Krishnadevaraya Univ Anantapur 515003 Andhra Pradesh India ACE Engn Coll Kancheepuram India

ISBN: (纸本)9788132225171;9788132225164

A distributed system (DS) consists of a set of computers networked together and gives an impression to the users that it is a single system. The main storage component to be used in a DS is distributed file system (DFS). The DFS is used as the main file storage system in the cloud computing systems. Most of the cloud-based applications require a good performance from the DFS as for as read operations are concerned. Many caching and pre-fetching techniques have been proposed in the literature for improving the performance of the DFS. But all of these techniques use synchronous approach which increases read access time. In the literature, a speculation-based technique has been proposed for improving the performance of read access in the DFS which implements asynchronous reading using client-side caching technique. In this paper, we have proposed a new read algorithm for the DFS based on asynchronous reading, client-side caching technique, and anticipated parallel processing. We have carried out performance analysis of the speculation-based algorithm and our proposed algorithm based on anticipated parallel processing. The results of analysis indicate that our proposed algorithm performs better than the earlier speculation-based algorithm.

关键词： File organization

来源：评论

学校读者我要写书评

暂无评论

Network Time Protocol Simulator

Network Time Protocol Simulator

引用

13th WSEAS International Conference on Computers

作者： Aldea, Costel Aldea, Alina Univ Transilvania Brasov Dept Comp Sci Iuliu Maniu 50 Brasov 500091 Romania Univ Transilvania Brasov Lib Brasov 500091 Romania

ISBN: (纸本)9789604740994

The clock synchronization problem in distributed system is meant to address the following issues: events generation at exact moment in time and to distribute computing for parallel and distributed algorithms. Nowadays the biggest distributed system, Internet, has the clocks synchronized based on the Network Time Protocol. This paper presents the implementation of an NTP simulator coded in Java. This simulator brings to the user the following advantages: the user has directly access to the protocol logic;trough the simulator the user see the guiding steps of the algorithm such that it understands how it works in background on the Internet or somewhere else and the user has also total control of the simulation and of the needed computing steps. Among the simulator requirements we enumerate: extensibility (the simulator can be easily extended to simulate other distributed algorithms), different configurations, undo facility implemented using memento design pattern, save and load of configurations, step by step running of simulations (the user can do an event guided simulation or time based simulation and the analyze the log files), platform independence (while it is based on Java can be run on different operating systems) etc.

关键词： distributed systems clocks synchronization simulation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共51页 << < 7 8 9 10 11 12 13 14 15 16 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：