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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,645 篇 会议
53 篇 期刊文献
12 册 图书

馆藏范围

1,710 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,163 篇 工学
- 1,104 篇 计算机科学与技术...
- 417 篇 软件工程
- 161 篇 电气工程
- 128 篇 信息与通信工程
- 76 篇 电子科学与技术（可...
- 62 篇 控制科学与工程
- 18 篇 生物工程
- 18 篇 网络空间安全
- 17 篇 材料科学与工程（可...
- 14 篇 仪器科学与技术
- 14 篇 生物医学工程（可授...
- 12 篇 环境科学与工程（可...
- 11 篇 机械工程
- 11 篇 化学工程与技术
- 11 篇 安全科学与工程
- 10 篇 光学工程
- 10 篇 动力工程及工程热...
- 10 篇 交通运输工程
- 9 篇 力学（可授工学、理...
- 9 篇 建筑学
225 篇 理学
- 162 篇 数学
- 39 篇 物理学
- 23 篇 系统科学
- 22 篇 统计学（可授理学、...
- 20 篇 生物学
- 13 篇 化学
183 篇 管理学
- 150 篇 管理科学与工程(可...
- 41 篇 工商管理
- 39 篇 图书情报与档案管...
6 篇 医学
5 篇 法学
5 篇 农学
4 篇 经济学
2 篇 教育学
2 篇 艺术学
1 篇 军事学

主题

151 篇 parallel process...
106 篇 application soft...
91 篇 concurrent compu...
85 篇 distributed proc...
84 篇 computer archite...
83 篇 distributed comp...
78 篇 hardware
63 篇 computational mo...
61 篇 graphics process...
59 篇 parallel process...
58 篇 graphics process...
56 篇 computer science
55 篇 kernel
51 篇 instruction sets
50 篇 scalability
50 篇 bandwidth
48 篇 runtime
47 篇 resource managem...
43 篇 libraries
42 篇 multicore proces...

机构

8 篇 ohio state univ ...
7 篇 ibm thomas j. wa...
6 篇 georgia inst tec...
5 篇 shanghai jiao to...
5 篇 school of comput...
5 篇 univ manitoba de...
5 篇 georgia state un...
5 篇 oak ridge natl l...
5 篇 univ illinois de...
5 篇 st francis xavie...
4 篇 univ calif river...
4 篇 school of comput...
4 篇 iowa state univ ...
4 篇 college of compu...
4 篇 college of compu...
4 篇 virginia tech de...
3 篇 university of sc...
3 篇 department of co...
3 篇 chinese acad sci...
3 篇 oak ridge natl l...

作者

10 篇 yang laurence t.
8 篇 cappello franck
6 篇 agrawal gagan
6 篇 matsuoka satoshi
5 篇 bader david a.
5 篇 parashar manish
5 篇 panda dhabaleswa...
5 篇 sun xian-he
4 篇 snir marc
4 篇 frederic suter
4 篇 zheng wm
4 篇 yaobin wang
4 篇 tang tao
4 篇 yang ltr
4 篇 a. choudhary
4 篇 endo toshio
4 篇 kumar sameer
4 篇 kale laxmikant v...
4 篇 chen dan
4 篇 thakur rajeev

语言

1,658 篇 英文
48 篇 其他
4 篇 中文
1 篇 土耳其文

检索条件"任意字段=2nd International Symposium on Parallel and Distributed Processing and Applications"

共 1710 条记录，以下是741-750 订阅

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

详细简洁

排序：

Smart Job Scheduling for High-Performance Cloud Computing Services

Smart Job Scheduling for High-Performance Cloud Computing Se...

引用

2nd international Conference on parallel, distributed, Grid and Cloud Computing for Engineering

作者： Muhtaroglu, N. Ari, I. Ozyegin Univ Istanbul Turkey

ISBN: (纸本)9781905088423

In this paper, we describe the challenges faced and lessons learned while establishing a large-scale high performance cloud computing service that enables online mechanical structural analysis and many other scientific applications using the finite element analysis (FEA) technique. The service is intended to process many independent and loosely-dependent (e.g. assembled system) tasks concurrently. Challenges faced include accurate job characterization, handling of many-task mixed jobs, sensitivity of task execution to multi-threading parameters, effective multi-core scheduling in a single node, and achieving seamless scale across multiple nodes. We find that significant performance gains in terms of both job completion latency and throughput are possible via dynamic or "smart" partitioning and resource-aware scheduling compared to shortest first and aggressive job scheduling techniques. We also discuss issues related to secure and private processing of sensitive models in the cloud.

关键词： cloud computing finite element analysis platform-as-a-service structural mechanics task scheduling multi-core parallel computing message passing interface

来源：评论

学校读者我要写书评

暂无评论

parallel processing framework on a P2P system using Map and reduce primitives

Parallel processing framework on a P2P system using Map and ...

引用

25th IEEE international parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Lee, Kyungyong Choi, Tae Woong Ganguly, Arijit Wolinsky, David I. Boykin, P. Oscar Figueiredo, Renato ACIS Lab. Department of ECE University of Florida United States Samsung SDS Seoul Korea Republic of Amazon Web Service United States

ISBN: (纸本)9780769543857

This paper presents a parallel processing framework for structured Peer-To-Peer (P2P) networks. A parallel processing task is expressed using Map and Reduce primitives inspired by functional programming models. The Map and Reduce tasks are distributed to a subset of nodes within a P2P network for execution by using a self-organizing multicast tree. The distribution latency cost of multicast method is O(log(N)), where N is a number of target nodes for task processing. Each node getting a task performs the Map task, and the task result is summarized and aggregated in a distributed fashion at each node of the multicast tree during the Reduce task. We have implemented this framework on the Brunet P2P system, and the system currently supports predefined Map and Reduce tasks or tasks inserted through Remote Procedure Call (RPC) invocations. A simulation result demonstrates the scalability and efficiency of our parallel processing framework. An experiment result on PlanetLab which performs a distributed K-Means clustering to gather statistics of connection latencies among P2P nodes shows the applicability of our system in applications such as monitoring overlay networks. © 2011 IEEE.

关键词： Functional programming

来源：评论

学校读者我要写书评

暂无评论

Controlling P2P applications via address harvesting: The skype story

Controlling P2P applications via address harvesting: The sky...

引用

25th IEEE international parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Bremler-Barr, Anat Dekel, Omer Ran, Goldschmiedt Levy, Hanoch Interdisciplinary Center Herzliya Israel University of Haifa Israel Tel-Aviv University Tel-Aviv Israel

ISBN: (纸本)9780769543857

P2P applications have become a dominant force in the Internet, both as an economic factor and as a traffic contributor. A "battle of power" is ongoing between the application providers and the Internet Service Providers (ISPs) on who will control this traffic. This is motivated by both economic incentives and QoS objectives. Little is known to the ISPs about the architecture of such applications or about the identity of their sessions;these are hidden by the application providers (assisted by their distributed control structure) making the ISPs' life harder. We are interested in Skype, as a very popular representative of distributed P2P applications. We explore the possibility of getting control/blocking Skype sessions by harvesting its Super Nodes (SNs), and blocking the network clients from connecting to them. Using experimental results and an analytical model we show that it is possible to collect a large enough number of SNs to block, with a probability higher than 95%. We further use the model to show that our approach is robust against possible strategies that can be adopted by Skype to maximize its resilience to blocking. The results derived and the vulnerability to SN harvesting, though discussed in the context of Skype, are general and may hold true for other Super Node based P2P systems. ©. 2011 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Affordable privacy for home smart meters

Affordable privacy for home smart meters

引用

9th IEEE international symposium on parallel and distributed processing with applications Workshops (ISPAW)/ICASE/SGH/GSDP

作者： Kalogridis, Georgios Fan, Zhong Basutkar, Sagar Toshiba Res Europe Ltd Telecommun Res Lab 32 Queen Sq Bristol BS1 4ND Avon England Univ Bristol Elect & Elect Engn Dept Bristol BS8 1TH Avon England

ISBN: (纸本)9780769544298

Smart metering is an essential element of the future smart grid development. However, frequent data collected by home smart meters reveal a wealth of information about residential appliance usage. This gives rise to the smart metering privacy problem. Smart metering data privacy can be protected by using a battery to mask energy usage profiles. However, such a system privately modifies usage consumption patterns and it may induce a cost depending on battery performance and dynamic utility pricing. The aim of this paper is to show a) how information theoretic anonymity metrics can be used to measure the privacy protection offered by a water-filling power transformation algorithm, b) how a good level of protection and a low maintenance cost can be obtained with reasonably sized batteries, and c) what is the impact on the utility and price. Our initial cost analysis results suggest that it is possible to communicate granular smart metering information, protect the consumers' privacy at a low cost, and promote load balancing in the smart grid. That renders our privacy protection system affordable.

关键词： Smart grid privacy privacy metrics home energy management battery costs

来源：评论

学校读者我要写书评

暂无评论

processing Cryptanalysis of Hash Functions using Graphics processing Units

Processing Cryptanalysis of Hash Functions using Graphics Pr...

引用

2nd international Conference on parallel, distributed, Grid and Cloud Computing for Engineering

作者： Gomez, J. Gil, C. Montoya, F. G. Marquez, A. L. Molero, G. Alcayde, A. Univ Almeria La Canada De San Urbano Almeria Spain

ISBN: (纸本)9781905088423

Auditing communications in companies to verify their correct operation and to check that there is no illegal activity is quite often. The main problem is that the tools of audit are inefficient when communications are encrypted. A hash function is a deterministic function that irreversibly converts a variable-sized message block to a fixed length string. Hash functions are widely used in cryptographic applications such as digital signatures, message authentication codes, etc. Cryptographic primitives such as block ciphers, hash functions are such an integral part of everyday computing. There are hacking and cryptanalysis techniques that allow intercepting and auditing encrypted communications with a computational cost so high that it is not a viable application in real time. Moreover, the recent use of graphics processing unit (GPU) in high-performance servers is changing this trend. This article presents a comparative study among the implementation of brute force attacks and Rainbow tables generation. This study has been carried out with a sequential algorithm and three parallel algorithms, using threads, MPI and CUDA implementations. These programs were performed on a NVIDIA TESLA S1070, with four Tesla T10 processors each with a total of 960 cores of 1.44 GHz. Finally, we can say that CUDA has the best technology in brute force attacks while MPI presents the best results in the generation of Rainbow tables.

关键词： CUDA MPI hash audit tools rainbow tables brute force

来源：评论

学校读者我要写书评

暂无评论

From simulation to experiment: A case study on multiprocessor task scheduling

From simulation to experiment: A case study on multiprocesso...

引用

25th IEEE international parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Hunold, Sascha Casanova, Henri Suter, Frédéric CNRS LIG Laboratory Grenoble France Dept. of Information and Computer Sciences University of Hawaii Manoa United States IN2P3 Computing Center CNRS/IN2P3 Lyon-Villeurbanne France

ISBN: (纸本)9780769543857

Simulation is a popular approach for empirically evaluating the performance of algorithms and applications in the parallel computing domain. Most published works present results without quantifying simulation error. In this work we investigate accuracy issues when simulating the execution of parallel applications. This is a broad question, and we focus on a relevant case study: the evaluation of scheduling algorithms for executing mixed-parallel applications on clusters. Most such scheduling algorithms have been evaluated in simulation only. We compare simulations to real-world experiments in a view to identify which features of a simulator are most critical for simulation accuracy. Our first finding is that simple yet popular analytical simulation models lead to simulation results that cannot be used for soundly comparing scheduling algorithms. We then show that, by contrast, simulation models instantiated based on brute-force measurements of the target execution environment lead to usable results. Finally, we develop empirical simulation models that provide a reasonable compromise between the two previous approaches. © 2011 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

iMapReduce: A distributed computing framework for iterative computation

iMapReduce: A distributed computing framework for iterative ...

引用

25th IEEE international parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Zhang, Yanfeng Gao, Qinxin Gao, Lixin Wang, Cuirong Northeastern University China University of Massachusetts Amherst United States

ISBN: (纸本)9780769543857

Relational data are pervasive in many applications such as data mining or social network analysis. These relational data are typically massive containing at least millions or hundreds of millions of relations. This poses demand for the design of distributed computing frameworks for processing these data on a large cluster. MapReduce is an example of such a framework. However, many relational data based applications typically require parsing the relational data iteratively and need to operate on these data through many iterations. MapReduce lacks built-in support for the iterative process. This paper presents iMapReduce, a framework that supports iterative processing. iMapReduce allows users to specify the iterative operations with map and reduce functions, while supporting the iterative processing automatically without the need of users' involvement. More importantly, iMapReduce significantly improves the performance of iterative algorithms by (1) reducing the overhead of creating a new task in every iteration, (2) eliminating the shuffling of the static data in the shuffle stage of MapReduce, and (3) allowing asynchronous execution of each iteration, i.e., an iteration can start before all tasks of a previous iteration have finished. We implement iMapReduce based on Apache Hadoop, and show that iMapReduce can achieve a factor of 1.2 to 5 speedup over those implemented on MapReduce for well-known iterative algorithms. © 2011 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Just-in-time instruction set extension - Feasibility and limitations for an FPGA-based reconfigurable ASIP architecture

Just-in-time instruction set extension - Feasibility and lim...

引用

25th IEEE international parallel and distributed processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Grad, Mariusz Plessl, Christian Paderborn Center for Parallel Computing University of Paderborn Germany

ISBN: (纸本)9780769543857

In this paper, we study the feasibility of moving the instruction set customization process for reconfigurable ASIPs to runtime under the precondition that current FPGA devices and tools are used. To this end we propose a tool flow for just-in-time ASIP customization which identifies suitable custom instructions to accelerate arbitrary binary applications that execute on a virtual machine. The tool flow targets our previously introduced Woolcano reconfigurable ASIP architecture, which augments the PowerPC core in a Xilinx Virtex 4FX CPU with runtime reconfigurable instructions. We evaluate the tool flow with a comprehensive set of applications from the SPEC2006, SPEC2000, MiBench, and SciMark2 benchmark suites and compare the speedups that can be achieved with the overhead of the complete ASIP specialization process. We show that an average speedup of 5× can be achieved for benchmarks from the embedded computing domain. The overhead of custom instruction identification and hardware generation for these benchmarks is less than 50 minutes and will be compensated if the applications execute for more than 2 hours. Finally, we evaluate caching strategies to reduce the time until this break even point is reached. © 2011 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Single node on-line simulation of MPI applications with SMPI

Single node on-line simulation of MPI applications with SMPI

引用

25th IEEE international parallel and distributed processing symposium, IPDPS 2011

作者： Clauss, Pierre-Nicolas Stillwell, Mark Genaud, Stéphane Suter, Frederic Casanova, Henri Quinson, Martin Nancy University LORIA INRIA Nancy France Department of Information and Computer Sciences University of Hawai'i at Manoa Honolulu HI United States University of Strasbourg ICPS-LSIIT Illkirch France IN2P3 Computing Center CNRS IN2P3 Lyon-Villeurbanne France

ISBN: (纸本)9780769543857

Simulation is a popular approach for predicting the performance of MPI applications for platforms that are not at one's disposal. It is also a way to teach the principles of parallel programming and high-performance computing to students without access to a parallel computer. In this work we present SMPI, a simulator for MPI applications that uses on-line simulation, i.e., the application is executed but part of the execution takes place within a simulation component. SMPI simulations account for network contention in a fast and scalable manner. SMPI also implements an original and validated piece-wise linear model for data transfer times between cluster nodes. Finally SMPI simulations of large-scale applications on large-scale platforms can be executed on a single node thanks to techniques to reduce the simulation's compute time and memory footprint. These contributions are validated via a large set of experiments in which SMPI is compared to popular MPI implementations with a view to assess its accuracy, scalability, and speed. © 2011 IEEE.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

A Visualization Technique for the Passage Rates of Unit Testing and Static Checking with Caller-Callee Relationships

A Visualization Technique for the Passage Rates of Unit Test...

引用

9th IEEE international symposium on parallel and distributed processing with applications Workshops (ISPAW)/ICASE/SGH/GSDP

作者： Muto, Yuko Okano, Kozo Kusumoto, Shinji Osaka Univ Grad Sch Informat Sci & Technol Suita Osaka Japan

ISBN: (纸本)9780769544298

Software visualization has attracted lots of attention. The techniques fall into two categories: visualization of software component relationships and visualization of software metrics. We propose a new hybrid method based on both of the two categories. The proposed method visualizes coincidence between specification and implementation from two aspects: static checking and ordinal testing by test suites. Each of the verification is performed in a method or function basis (unit testing). In our method, each ratio of the coincidence is shown by pie charts which represent classes of the target software. Whole software is represented in a weighted digraph structure. We have prototyped a tool implemented our proposed method. We have evaluated the availability of the proposed method by applying the tool to two kinds of software: Warehouse Management Program, and a telephone directory management program. As a result, we conclude that the proposed method shows informative results.

关键词： component unit testing static checking ESC/Java2 software quality visualization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共171页 << < 71 72 73 74 75 76 77 78 79 80 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：