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

4th and 5th Workshops on Big Data Benchmarks, Performance Optimization, and Emerging Hardware, BPOE 2014

作者： Liang, Yi Wang, Yufeng Fan, Minglu Zhang, Chen Zhu, Yuqing Department of Computer Science Beijing University of Technology Beijing China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy Sciences Beijing China

ISBN: (纸本)9783319130200

Map/Reduce is a popular parallel processing framework for data intensive computing. For overlapping the Map task’s execution phase and the Reduce task’s intermediate data fetching and merging phase, existing Map/ Reduce schedulers always pre-launch the Reduce task at the specific threshold where its map tasks have been launched, and this pattern incurs the occupation of the consuming resources of the reduce task during its idle time on waiting for fetching the intermediate data from map tasks. To address this issue, we propose an extension version of Hadoop map/reduce framework, called Predoop, in this paper. The basic idea of Predoop is to preempt the reduce task during its idle time and allocate the released resource to the map tasks on schedule. To achieve this goal, first, we introduce the preemptive mechanism for reduce tasks and map tasks respectively to enable Map/Reduce tasks to be preempted or resumed with correct status;second, we adopt the preempting-resuming model for the reduce task with the consideration of the progress of Reduce task data fetching & merging and the Map task execution so as to determine the timing of Reduce task preemption and resuming;third, we introduce the preemption-aware task scheduling strategy to allocate the released resources to the on-schedule Map tasks with the consideration of data locality. Experimental result demonstrates that Predoop outperforms Hadoop on various workload and the average job turnaround time can be reduced by maximum of 66.57 %. © Springer International Publishing Switzerland 2014.

关键词： Multitasking

来源：评论

学校读者我要写书评

暂无评论

Persistent B+-Trees in non-volatile main memory 41st

Persistent B+-Trees in non-volatile main memory

引用

41st International Conference on Very Large Data Bases, VLDB 2015

作者： Chen, Shimin Jin, Qin State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Computer Science Department School of Information Renmin University of China China

computer systems in the near future are expected to have Non- Volatile Main Memory (NVMM), enabled by a new generation of Non-Volatile Memory (NVM) technologies, such as Phase Change Memory (PCM), STT-MRAM, and Memristor. The non-volatility property has the promise to persist in-memory data structures for instantaneous failure recovery. However, realizing such promise requires a careful design to ensure that in-memory data structures are in known consistent states after failures. This paper studies persistent in-memory B+-Trees as B+-Trees are widely used in database and data-intensive systems. While traditional techniques, such as undo-redo logging and shadowing, support persistent B+-Trees, we find that they incur drastic performance overhead because of extensive NVM writes and CPU cache flush operations. PCM-friendly B+-Trees with unsorted leaf nodes help mediate this issue, but the remaining overhead is still large. In this paper, we propose write atomic B+-Trees (wB+-Trees), a new type of main-memory B+-Trees, that aim to reduce such overhead as much as possible. wB+-Tree nodes employ a small indirect slot array and/or a bitmap so that most insertions and deletions do not require the movement of index entries. In this way, wB+- Trees can achieve node consistency either through atomic writes in the nodes or by redo-only logging. We model fast NVM using DRAM on a real machine and model PCM using a cycle-accurate simulator. Experimental results show that compared with previous persistent B+-Tree solutions, wB+-Trees achieve up to 8.8x speedups on DRAM-like fast NVM and up to 27.1x speedups on PCM for insertions and deletions while maintaining good search performance. Moreover, we replaced Memcached's internal hash index with tree indices. Our real machine Memcached experiments show that wB+-Trees achieve up to 3.8X improvements over previous persistent tree structures with undo-redo logging or shadowing. © 2015 VLDB Endowment 21508097/15/03.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

Enhanced radial basis function neural network design using parallel evolutionary algorithms

Enhanced radial basis function neural network design using p...

引用

11th International Conference on Engineering Applications of Neural Networks, EANN 2009

作者： Parras-Gutierrez, Elisabet Garcia-Arenas, Maribel Isabel Rivas-Santos, Victor M. Department of Computer Sciences Campus Las Lagunillas s/n 23071 Jaen Spain Department of Computer Architecture and Technology C/Periodista Daniel Saucedo s/n 18071 Granada Spain

ISBN: (纸本)3642039685

In this work SymbPar, a parallel co-evolutionary algorithm for automatically design the Radial Basis Function Networks, is proposed. It tries to solve the problem of huge execution time of Symbiotic-CHC-RBF, in which method are based. Thus, the main goal of SymbPar is to automatically design RBF neural networks reducing the computation cost and keeping good results with respect to the percentage of classification and net size. This new algorithm parallelizes the evaluation of the individuals using independent agents for every individual who should be evaluated, allowing to approach in a future bigger size problems reducing significantly the necessary time to obtain the results. SymbPar yields good results regarding the percentage of correct classified patterns and the size of nets, reducing drastically the execution time. © 2009 Springer-Verlag.

关键词： Radial basis function networks

来源：评论

学校读者我要写书评

暂无评论

Development of a cortical visual neuroprosthesis for the blind: Replacing the role of the retina 7

Development of a cortical visual neuroprosthesis for the bli...

引用

7th International IEEE/EMBS Conference on Neural Engineering, NER 2015

作者： Fernández, Eduardo Martínez-Álvarez, Antonio Olmedo, Andres Romero, Samuel Morillas, Christian Ferrandez, Jose Manuel Pelayo, Francisco Normann, Richard A. University Miguel Hernández CIBER BBN Elche Spain Department of Computer Technology University of Alicante Spain Departament of Computer Architecture and Technology University of Granada Spain Department of Electronics and Computer Technology Technical University of Cartagena Spain Department of Bioengineering University of Utah Salt Lake CityUT United States

ISBN: (纸本)9781467363891

Cortical prostheses are a subgroup of visual neuroprosthesis capable of eliciting visual percepts in profoundly blind people through direct stimulation of the occipital cortex. This approach is the only treatment available for blindness caused by glaucoma, optic atrophy or by diseases of the central visual pathways such as brain injuries or stroke. If these higher visual centers could be stimulated with visual information in a format somewhat similar to the way they were stimulated before the onset of blindness, a blind individual could be able to use this stimulation to extract information about the physical world around him/her. Here we present an update of the strategies we are using to transmit visual information in a meaningful way to the brain. © 2015 IEEE.

关键词： Neurosurgery

来源：评论

学校读者我要写书评

暂无评论

Using Takagi-Sugeno-Kang approximation fuzzy logic for evaluating the performance of color difference formulas in dentistry

Using Takagi-Sugeno-Kang approximation fuzzy logic for evalu...

引用

2011 11th International Conference on Intelligent Systems Design and Applications, ISDA'11

作者： Ghinea, Razvan De La Cruz Cardona, Juan Ionescu, Ana María Del Mar Perez, María Herrera, Luis Javier Department of Optics Faculty of Science University of Granada Granada Spain Department of Computer Architecture and Computer Technology E.T.S.I.I.T. University of Granada Granada Spain

ISBN: (纸本)9781457716751

The present work carries out a novel study on the determination of color acceptability thresholds using a Takagi-Sugeno-Kang (TSK) fuzzy approximation, performing an evaluation of the CIEDE2000(KL:KC:K H) color difference formula in dentistry. A total of 55 sample pairs were evaluated by a panel of 28 observers. The responses for each pair were processed, and data was fitted using a TSK Fuzzy Approximation, which in recent literature has proven to be a reliable and recommendable methodology for approximating color data in dentistry. 50:50% acceptability thresholds were calculated for both CIEDE2000(1:1:1) and CIEDE2000(2:1:1) formulas and the performance of these formulas was evaluated using the PF/3 and STRESS parameters. We obtained better values for all performance parameters for CIEDE2000(2:1:1), indicating the better agreement between this formula and the visual results. Our results suggest considering reviewing the parametric factors, so that the CIEDE2000 color difference formula can be properly used for further applications in dentistry. © 2011 IEEE.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

CASEMANS 2009: The 3rd ACM International Workshop on Context-Awareness for Self-Managing Systems 09

CASEMANS 2009: The 3rd ACM International Workshop on Context...

引用

3rd ACM International Workshop on Context-Awareness for Self-Managing Systems, Casemans 2009

作者： Dargie, Waltenegus Kuwahara, Noriaki Technical University of Dresden Institute for Systems Architecture Department of Computer Networks Dresde Germany Kyoto Institute of Technology Graduate School of Science and Technology Kyoto Japan

ISBN: (纸本)9781605584393

This year, the 3rd ACM International Workshop on Context-Awareness for Self-Managing Systems (Devices, Applications and Networks) (CASEMANS 2009) is organized in Nara, Japan. This article summarizes the objectives of the CASE-MANS 2009 workshop and gives an overview of the papers that are selected for presentation and publication. Copyright 2009 ACM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Extending dynamic reconfiguration to NOWs with adaptive routing 4th

Extending dynamic reconfiguration to NOWs with adaptive rout...

引用

4th International Workshop on Communication, architecture and Applications for Network-based Parallel Computing, CANPC 2000

作者： BermÚdez, Aurelio Alfaro, Francisco J. Casado, Rafael Duato, José Quiles, Francisco J. Sánchez, José L. Department of Computer Engineering and Technology University of Murcia Murcia30071 Spain Department of Computer Science University of Castilla-La Mancha Albacete02071 Spain Department of Information Systems and Computer Architecture Technical University of Valencia Valencia46071 Spain

ISBN: (纸本)3540678794

Many distributed applications executed on networks of workstations (NOWs) require the interconnection network to provide some quality of service (QoS) support. These networks must be able to support topology changes (due to component failures, hot replacement, hot expansion, etc.) without stopping traffic, in order to satisfy QoS requirements. Traditional network reconfiguration methods do not take this into account, causing a serious performance degradation while the network is being reconfigured. In [1,2], we proposed a new dynamic network reconfiguration protocol, called Partial Progressive Reconfiguration. It significantly reduces the negative effects produced by traditional methods. For this reason, it is especially suitable for applications requiring QoS. This reconfiguration protocol requires that messages are routed using up✶/down✶ routing. In this paper, we extend this dynamic reconfiguration technique to support adaptive routing, based on the design methodology for adaptive algorithms proposed in [3,4]. We also present performance evaluation results, clearly showing the benefits of using dynamic reconfiguration combined with adaptive routing. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Self organizing maps for visualization of categories

Self organizing maps for visualization of categories

引用

19th International Conference on Neural Information Processing, ICONIP 2012

作者： Szymański, Julian Duch, Wlodzislaw Department of Computer Systems Architecture Gdańsk University of Technology Poland Department of Informatics Nicolaus Copernicus University Toruń Poland School of Computer Engineering Nanyang Technological University Singapore Singapore

ISBN: (纸本)9783642344749

Visualization of Wikipedia categories using Self Organizing Maps shows an overview of categories and their relations, helping to narrow down search domains. Selecting particular neurons this approach enables retrieval of conceptually similar categories. Evaluation of neural activations indicates that they form coherent patterns that may be useful for building user interfaces for navigation over category structures. © 2012 Springer-Verlag.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

Replay using recomposition: Alignment-based conformance checking in the large

Replay using recomposition: Alignment-based conformance chec...

引用

2017 BPM Demo Track and BPM Dissertation Award, BPM-D and DA 2017, co-located with 15th International Conference on Business Process Management, BPM 2017

作者： Lee, Wai Lam Jonathan Verbeek, H.M.W. Munoz-Gama, Jorge Van Der Aalst, Wil M.P. Sepúlveda, Marcos Department of Mathematics and Computer Science Architecture of Information Systems Group Eindhoven University of Technology Netherlands Department of Computer Science School of Engineering Pontificia Universidad Católica de Chile Chile

In the area of process mining, efficient alignment-based conformance checking is a hot topic. Existing approaches for conformance checking are typically monolithic and compute exact fitness values. One limitation with monolithic approaches is that it may take a significant amount of computation time in large processes. Alternatively, decomposition approaches run much faster but do not always compute an exact fitness value. This paper presents the tool Replay using Recomposition which returns the exact fitness value and the resulting alignments using the decomposition approach in an iterative manner. Other than computing the exact fitness value, users can configure the balance between result accuracy and computation time to get a fitness interval within set constraints, e.g., "Give me the best fitness estimation you can find within 5 minutes".

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Using Mobile Sinks in WSN: Computational Complexity and a Theoretical Bound

引用

电子学报(英文版) 2011年第1期20卷 147-150页

作者： GU Yu JI Yusheng CHEN Hongyang ZHAO Baohua Department of Computer Science University of Science and Technology of China Hefei China State Key Laboratory of Networking and Switching Technology Beijing China Information Systems Architecture Science Research Division NII Tokyo Japan Institute of Industrial Science University of Tokyo Tokyo Japan

In this paper, we study the lifetime op- timization problem in wireless sensor networks using mo- bile sink nodes. This problem is inherently difficult since we need to consider both sink scheduling and data rout- ing. Through a simple case study we develop a novel no- tation named the Placement pattern (PP) to bound traffic patterns with candidate locations. This significantly de- creases the number of elements needed to be scheduled. Based on the PP, we mathematically formulate this opti- mization problem as a Mixed-integer non-linear program- ming (MINLP), which is very tough and time consuming to solve. By proving that the problem is NP-complete, we point out that instead of seeking an optimal algorithm, heuristic algorithms, especially those with performance guarantee, would be much more desirable to develop. Fur- thermore, in order to help identify performance gains of heuristic algorithms proposed in the future, we develop a Linear programming (LP) formulation which serves as an upper bound by adopting a reformulation and relaxation technique.

关键词：无线传感器网络移动接收计算复杂性混合整数非线性规划启发式算法 NP完全问题优化问题 MINLP

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：