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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是41-50 订阅

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

详细简洁

排序：

Salbnet: A Self-Adapting Load Balancing Network

Salbnet: A Self-Adapting Load Balancing Network

引用

12th iasted international conference on parallel and distributed computing and networks, pdcn 2014

作者： Jung, Jörg Schnor, Bettina Menski, Sebastian Institute for Computer Science University of Potsdam Potsdam Germany

Server Load Balancing (SLB) is a popular technique to build high-availability web services as offered from Google and Amazon for example. Credit based load balancing strategies have been proposed in the literature where the back end servers dynamically report a metric called Credit to the Load Balancer (LB) which reflects their current capacity. This enables the LB to adapt the load balancing strategy. The benefit of Credit based SLB has been shown by simulations, but up to now, it is not used in productive systems, since efficient implementations were missing. This paper presents the evaluation of an implementation of Credit based SLB, the so-called Self-Adapting Load Balancing Network (salbnet). We evaluate salbnet for a cluster of web servers. The measurements are done with a representative workload based on a Wikipedia trace and confirm the benefit of the self-adapting load balancing approach.

关键词： Cluster computing

来源：评论

学校读者我要写书评

暂无评论

On the relative significance of kernelization versus branching for parallel FPT implementations

On the relative significance of kernelization versus branchi...

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Hagan, Ronald D. Phillips, Charles A. Wang, Kai Rogers, Gary L. Lowcay, Callum Langston, Michael A. University of Tennessee Knoxville TN United States National Institute for Computational Sciences Oak Ridge TN United States Massey University Palmerston North New Zealand

ISBN: (纸本)9780889869431

We investigate the relative significance of kernelization versus branching for parallel FPT implementations. Using the well-known vertex cover problem as a familiar example, we build and experiment with a testbed of five different classes of difficult graphs. For some, we find that kernelization alone obviates the need for parallelism. For others, we show that kernelization and branching work in synergy to produce efficient implementations. And yet for others, kernelization fails completely, leaving branching to solve the entire problem. Structural graph properties are studied in an effort to explicate this trichotomy. The NP-completeness of vertex cover makes scalability an extreme challenge. We mainly employ Hopper, named after the famous computing pioneer Admiral Grace Murray Hopper. The Hopper platform is currently one of the world's fastest supercomputers.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

A distributed data store model satisfying sequential consistency or causal consistency with operation logs 13

A distributed data store model satisfying sequential consist...

引用

13th iasted international conference on parallel and distributed computing and networks, pdcn 2016

作者： Kitao, Daisuke Ikeda, Daisuke Department of Informatics Kyushu University 744 Moto-oka Fukuoka819-0395 Japan

ISBN: (纸本)9780889869790

A distributed data store can satisfy two properties out of three properties which are (strict) consistency, availability and partition-tolerance. In case of distributed data stores satisfying availability and partition-tolerance, they can satisfy weak consistency, especially causal consistency, which is the strongest consistency that can cohabit with other two properties. Moreover, if any networks between nodes have no problem and very low latency, the distributed data store can satisfy stronger consistency than causal consistency. Sequential consistency is one of the stronger consistency than causal consistency. In order to satisfy sequential consistency, a distributed data store needs to equalize an order of data changing in all nodes. In this paper, we propose distributed data store model containing special nodes "casting nodes" and algorithms in order to decide an order of operations. Thanks to the casting nodes, our model can satisfy sequential consistency when all networks can connect, and our model can satisfy causal consistency when any networks disconnect.

关键词： CAP theorem distributed data store Sequential consistency Strong consistency

来源：评论

学校读者我要写书评

暂无评论

OSPaaS: OSGi Service Platform as a Service

OSPaaS: OSGi Service Platform as a Service

引用

10th iasted international conference on parallel and distributed computing and networks, pdcn 2011

作者： Garwers, Sebastian Sulistio, Anthony Reich, Christoph Department of Computer Science Hochschule Furtwangen University Germany High Performance Computing Center Stuttgart Nobelstrasse 19 70550 Stuttgart Germany

ISBN: (纸本)9780889868649

The idea behind Cloud computing is to deliver Infrastructure-, Platform-, and Software as a Service (IaaS, PaaS, and SaaS) on a simple pay-per-use basis. In this paper, we introduce our work, OSGi Service Platform as a Service (OSPaaS), a PaaS model for running an OSGi service platform in the cloud for e-Learning and teaching purposes. OSPaaS leverages OpenNebula, a virtual infrastructure manager, to dynamically launch virtual machines (VMs) on idle resources or dedicated servers. In addition, OSPaaS uses Shibboleth as a Single Sign-On mechanism for seamless authentication and authorization. To assess the suitability of OSGi for cloud computing, this paper investigates and analyzes three OSGi frameworks, i.e. Knopflerfish, Equinox and Apache Felix. Subsequently, an OSPaaS architecture is presented and described. Finally, this paper shows a use case scenario and advantages of OSPaaS for e-Learning & teaching purposes.

关键词： Platform as a Service (PaaS)

来源：评论

学校读者我要写书评

暂无评论

A cache-aware thread scheduling policy for multi-core processors

A cache-aware thread scheduling policy for multi-core proces...

引用

iasted international conference on parallel and distributed computing and networks, pdcn 2009

作者： Sato, Masayuki Kotera, Isao Egawa, Ryusuke Takizawa, Hiroyuki Kobayashi, Hiroaki Graduate School of Information Sciences Tohoku University Aramaki-Aza-Aoba Aoba-ku Sendai 980-8578 Japan Cyberscience Center Tohoku University Aramaki-Aza-Aoba Aoba-ku Sendai 980-8578 Japan

ISBN: (纸本)9780889867840

A modern high-performance multi-core processor has large shared cache memories. However, simultaneously running threads do not always require the entire capacities of the shared caches. Besides, some threads cause severe performance degradation by inter-thread cache conflicts and shortage of capacity on the shared cache. To achieve high performance processing on multi-core processors, effective usage of shared cache memories plays important role. In this paper, we propose a cache-aware thread scheduling policy for multi-core processors with multiple shared cache memories. The total processor performance becomes more sensitive to the cache capacity shortage, as larger caches are requested by the threads sharing one cache. The proposed policy can prevent multiple threads requesting a large cache capacity from sharing one cache. As a result, the policy can prevent inter-thread resource conflicts and hence severe performance degradation. Experimental results clearly demonstrate that the policy assists the cache partitioning mechanisms and avoids unfair performance degradation among threads. Thread scheduling based on the proposed policy can improve the performance by up to 10% and an average of 5% compared with thread scheduling without the proposed policy.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Regulate my appetite according to dishes: A distributed on-line optimal stopping web service selection scheme

Regulate my appetite according to dishes: A distributed on-l...

引用

11th iasted international conference on parallel and distributed computing and networks, pdcn 2013

作者： Liu, Siping Zhang, Yaoxue Zhou, Yuezhi Liu, Hao Zhang, Di Hu, Wei Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9780889869431

This paper demonstrates a distributed on-line service selection( probe/access) scheme: optimal stopping web service selection scheme based on the rate of return problem from optimal stopping theory. There are three differences between our scheme and the conventional schemes. Firstly, it does not need to probe all web services, and only probe a few web services. Secondly, our scheme focuses on maximizing the average QoS(Quality of Service) return per unit of cost over all stages of probe and access for a long period rather than maximizing QoS return per single stage of probe and access in usual schemes. Thirdly, our scheme develops a return function based on three factors: QoS return, user's requirement and probe cost which are seldom considered simultaneously before. Through theory analysis and computation, we demonstrate that compared with the conventional schemes our scheme has additional advantages while achieving same good performances.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel architecture of median filter

Efficient parallel architecture of median filter

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Medhat, R. Faheem, H.M. Khaleefa, M.E. Computer Systems Department Faculty of Computer and Information Sciences Ain Shams University Cairo Egypt

ISBN: (纸本)9780889868205

Many attempts have been made to optimize the median filter from the software and hardware approach. An architectural design of hardware capable of performing real-time median filtering is presented. The architecture uses the histogram approach to calculate the median, while optimizing the sliding window method to reuse all its calculations. Data is output row by row and every input pixel is processed only once. The design is independent of window size or image size, and supports adding more processing elements to support wider images. The control unit design is minimized to enable self-adjustment of plug-and-play processing elements. The architecture is implemented in VHDL and synthesized to a Virtex-2 Pro FPGA. The architecture's performance as well as operation is compared to previous work.

关键词： Electric filters

来源：评论

学校读者我要写书评

暂无评论

Task allocation method for avoiding contentions by the information of concurrent communications

Task allocation method for avoiding contentions by the infor...

引用

10th iasted international conference on parallel and distributed computing and networks, pdcn 2011

作者： Morie, Yoshiyuki Nanri, Takeshi Kurokawa, Motoyoshi Research Institute for Information Technology Kyushu University 6-10-1 Hakozakl Higashi-Ku Fukuoka Japan Advanced Center for Computing and Communication RIKEN Wako Japan

ISBN: (纸本)9780889868649

This paper proposes an optimization method of task-allocation for reducing contentions. There have been some attempts for optimizing task-allocation that minimizes the product of the amount of communications and the number of the communication hops. However, since those methods do not consider the occurrence of contentions, the effect has not been sufficient. The method proposed in this paper uses information of concurrent communication to estimate the effect of contentions to find the optimal task-allocation. In three environments examined on the experiments, the proposed method has shown a better effect than the existing method on two environments, tree and fat tree. On these environments, the maximum gain of performance over the existing method was about 25%. On the other hand, on a mesh environment, IBM BlueGene/L, the existing method better effect than the proposed method. As one of the reasons for this, the influence of the packet priority on the network of BlueGene/L to the behavior of the proposed method is discussed.

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

Reactive grid scheduling of DAG applications

Reactive grid scheduling of DAG applications

引用

iasted international conference on parallel and distributed computing and networks, pdcn 2007

作者： Hernandez, Israel Cole, Murray Institute for Computing Systems Architecture School of Informatics University of Edinburgh

ISBN: (纸本)9780889866379

We consider the problem of scheduling parallel applications, represented by directed acyclic graphs (DAGs), onto Grid style resource pools. The core issues are that the availability and performance of grid resources, which are already by their nature heterogeneous, can be expected to vary dynamically, even during the course of an execution. Typical scheduling methods in the literature partially address this issue because they consider static heterogenous computing environments (i.e. heterogeneous resources are dedicated and unchanging over time). This paper presents the Grid Task Positioning GTP scheduling method, which addresses the problem by allowing rescheduling of an executing application in response to significant variations in resource characteristics. GTP considers the impact of partial completion of tasks and task migration. We compare the performance of GTP with that of the well-known, and static, Heterogeneous Earliest Finish Time (HEFT) algorithm.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

On the tradeoff between speedup and energy consumption in high performance computing - A bioinformatics case study

On the tradeoff between speedup and energy consumption in hi...

引用

9th iasted international conference on parallel and distributed computing and networks, pdcn 2010

作者： Pawaskar, Sachin Ali, Hesham H. Department of Computer Science College of Information Science and Technology University of Nebraska at Omaha Omaha NE 68182 United States

ISBN: (纸本)9780889868205

High Performance computing has been very useful to researchers in the Bioinformatics, Medical and related fields. The bioinformatics domain is rich in applications that require extracting useful information from very large and continuously growing sequence of databases. Automated techniques such as DNA sequencers, DNA microarrays & others are continually growing the dataset that is stored in large public databases such as GenBank and Protein DataBank. Most methods used for analyzing genetic/protein data have been found to be extremely computationally intensive, providing motivation for the use of powerful computers or systems with high throughput characteristics. In this paper, we provide a case study for one such bioinformatics application called BLAT running in a high performance computing environment. We use sequences gathered from researchers and parallelize the runs to study the performance characteristics under three different query and data partitioning models. This research highlights the need to carefully develop a parallel model with energy awareness in mind, based on our understanding of the application and then appropriately designing a parallel model that works well for the specific application and domain. We found that the BLAT program is highly parallelizable and a high degree of speedup is achievable. The experiments suggest that the speed up depends on model used for query and database segmentation.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：