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

CEUR Workshop Proceedings 2017年 1826卷

作者： Kopp, Oliver Lenhard, Jörg Pautasso, Cesare University of Stuttgart Institute for Parallel and Distributed Systems Universitätsstraße 38 StuttgartDE70569 Germany Karlstad University Department of Mathematics and Computer Science Universitetsgatan 2 KarlstadSE65188 Sweden USI Faculty of Informatics Architecture Design and Web Information Systems Engineering Research Group Via Buffi 13 LuganoCH6900 Switzerland

来源：评论

学校读者我要写书评

暂无评论

Task allocation in organic computing systems: Networks with reconfigurable helper units

引用

International Journal of Autonomous and Adaptive Communications systems 2015年第1期8卷 60-80页

作者： Merkle, Daniel Middendorf, Martin Scheidler, Alexander Department of Mathematics and Computer Science University of Southern Denmark Campusvej 55 Odense M5230 Denmark Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Johannisgasse 26 Leipzig04103 Germany Université Libre de Bruxelles Av F. D. Roosevelt 50 CP 194/6 Bruxelles1050 Belgium

In this paper, computing systems that have no central control and consist of many (partially) autonomous components are studied. Two types of components are distinguished which are called workers and helpers respectively. The components are connected via a network and the helper components perform service tasks for the worker components. It is assumed that the helper components exhibit reconfigurable hardware to be able to execute different service tasks efficiently. The problem addressed in this paper is how to organise such a decentralised system in a way that requests of the workers are executed by suitable helpers and the total reconfiguration costs of the helpers are small. Several decentralised task allocation methods are proposed. One of them uses a combination of a fully decentralised dynamic clustering algorithm and a self-organised task allocation system. The clustering algorithm is used to classify the service requests that are sent through the network in order to give the helpers hints which requests are suitable to be executed by them. Simulations are done for static and dynamic scenarios to investigate the reconfiguration costs and the number of dropped requests, i.e., requests that could not be satisfied. The results show that the clustering-based system has a strong adaptive behaviour and that the decentralised clustering is able to reduce the reconfiguration costs significantly. Copyright © 2015 Inderscience Enterprises Ltd.

关键词： Reconfigurable hardware

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017) of the Organization for Computational Neuroscience Antwerp, Belgium, July 15-20, 2017

引用

BMC NEUROscience 2017年第SUPPL 1期18卷 59-59页

作者： [Anonymous] Indiana University Purdue University Indianapolis Indianapolis IN 46032 USA Stark Neurosciences Research Institute Indiana University School of Medicine Indianapolis IN 46032 USA Department of Mathematics East Carolina University Greenville NC 27858 USA Jülich Supercomputing Centre Forschungszentrum Jülich 52425 Jülich Germany Future Systems Swiss National Supercomputing Centre 8092 Zurich Switzerland User Engagement and Support Swiss National Supercomputing Centre 6900 Lugano Switzerland Institut de Neurosciences des Systèmes Aix Marseille Univ 13005 Marseille France Simulation Lab Neuroscience Forschungszentrum Jülich Jülich Germany Department of Experimental Psychology Ghent University 9000 Ghent Belgium Donders Center for Cognitive Neuroimaging Radboud University 6525HR Nijmegen The Netherlands Department of Electrical Computer and Energy Engineering University of Colorado Boulder CO 80309 USA Department of Neurosurgery Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Neurology Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Otolaryngology Johns Hopkins School of Medicine Baltimore MD 21287 USA INSERM U968 Paris France Sorbonne Universités UPMC University Paris 06 UMR_S 968 Institut de la Vision Paris France CNRS UMR_7210 Paris France Department of Computer Architecture and Technology University of Granada (CITIC) Granada Spain Sorbonne Universités UPMC Univ Paris 06 INSERM CNRS Institut de la Vision Paris France Department of Adaptive Machine Systems Osaka University Osaka Japan Department of Computer Science University of Cergy-Pontoise Cergy-Pontoise France Department of Physics and Astronomy College of Charleston Charleston SC 29424 USA School of Physics Faculty of Science University of Sydney Sydney NSW 2006 Australia Center of Excellence for Integrative Brain Function Australian Research Council Sydney Australia Max Planck Institute for Human Cognitive and Brain Sciences Saxony Lei

来源：评论

学校读者我要写书评

暂无评论

A dataflow inspired programming paradigm for coarse-grained reconfigurable arrays

A dataflow inspired programming paradigm for coarse-grained ...

引用

10th International Symposium on Reconfigurable Computing: architectures, Tools, and Applications, ARC 2014

作者： Niedermeier, A. Kuper, Jan Smit, Gerard J. M. Computer Architecture for Embedded Systems Group Department of Electrical Engineering Mathematics and Computer Science University of Twente Netherlands

ISBN: (纸本)9783319059594

In this paper, we present a new approach towards programming coarse-grained reconfigurable arrays (CGRAs) in an intuitive, dataflow inspired way. Based on the observation that available CGRAs are usually programmed using C, which lacks proper support for instruction-level parallelism, we instead started from a dataflow perspective combined with a language that inherently supports parallel structures. Our programming paradigm decouples the local functionality of a core from the global flow of data, i.e. the kernels from the routing. We will describe the ideas of our programming paradigm and also the language and compiler itself. Our complete system, including the CGRA, the programming language and the compiler, was developed using Haskell, which leads to a complete, sound system. We finish the paper with the implementation of a number of algorithms using our system. © 2014 Springer International Publishing Switzerland.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Accounting for cache related pre-emption delays in hierarchical scheduling 14

Accounting for cache related pre-emption delays in hierarchi...

引用

22nd International Conference on Real-Time Networks and systems, RTNS 2014

作者： Lunniss, Will Altmeyer, Sebastian Lipari, Giuseppe Davis, Robert I. Department of Computer Science University of York York United Kingdom Computer Systems Architecture Group University of Amsterdam Netherlands Scuola Superiore Sant'Anna Italy LSV ENS Cachan France

ISBN: (纸本)9781450327275

Hierarchical scheduling provides a means of composing multiple real-time applications onto a single processor such that the temporal requirements of each application are met. This has become a popular technique in industry as it allows applications from multiple vendors as well as legacy applications to co-exist in isolation on the same platform. However, performance enhancing features such as caches mean that one application can interfere with another by evicting blocks from cache that were in use by another application, violating the requirement of temporal isolation. While one solution is to flush the cache after every application context switch, this can potentially lead to a degradation in performance. In this paper, we present analysis that bounds the additional delay due to blocks being evicted from cache by other applications in a system using hierarchical scheduling. Copyright © 2014 ACM.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Density estimation with adaptive sparse grids for large data sets 14

Density estimation with adaptive sparse grids for large data...

引用

14th SIAM International Conference on Data Mining, SDM 2014

作者： Peherstorfer, Benjamin Pflüger, Dirk Bungartz, Hans-Joachim Aerospace Computational Design Laboratory AeroAstro Massachusetts Institute of Technology United States Simulation of Large Systems Group Institute for Parallel and Distributed Systems University of Stuttgart Germany Scientific Computing Group Department of Computer Science Technische Universität München Germany

ISBN: (纸本)9781510811515

Nonparametric density estimation is a fundamental problem of statistics and data mining. Even though kernel density estimation is the most widely used method, its performance highly depends on the choice of the kernel bandwidth, and it can become computationally expensive for large data sets. WTe present an adaptive sparse-grid-based density estimation method which discretizes the estimated density function on basis functions centered at grid points rather than on kernels centered at the data points. Thus, the costs of evaluating the estimated density function are independent from the number of data points. We give details on how to estimate density functions on sparse grids and develop a cross validation technique for the parameter selection. We show numerical results to confirm that our sparse-grid-based method is well-suited for large data sets, and, finally, employ our method for the classification of astronomical objects to demonstrate that it is competitive to current kernel-based density estimation approaches with respect to classification accuracy and runtime. Copyright © SIAM.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 1

引用

BMC Neurosci 2017年第SUPPL 1期18卷 58-58页

作者： Sue Denham Panayiota Poirazi Erik De Schutter Karl Friston Ho Ka Chan Thomas Nowotny Dongqi Han Sungho Hong Sophie Rosay Tanja Wernle Alessandro Treves Sarah Goethals Romain Brette Tomas Van Pottelbergh Rodolphe Sepulchre Alex D. Bird Hermann Cuntz Pedro J. Gonçalves Jan-Matthis Lueckmann Giacomo Bassetto Marcel Nonnenmacher Jakob H. Macke Audrey J. Sederberg Jason N. MacLean Stephanie E. Palmer Ulisse Ferrari Christophe Gardella Olivier Marre Thierry Mora Emina Ibrahimovic Martin Müller Jean-Pascal Pfister Tushar Chauhan Timothée Masquelier Alexandre Montlibert Benoit R. Cottereau Moritz Helias Jannis Schuecker David Dahmen Sven Goedeke Alexandre Hyafil Ainhoa Hermoso-Mendizabal Pavel E. Rueda-Orozco Santiago Jaramillo David Robbe Jaime de la Rocha Marie Rooy Fani Koukouli David DiGregorio Uwe Maskos Boris Gutkin Andrey Yu Verisokin Darya V. Verveyko Dmitry E. Postnov Willy Wong Omid Talakoub Robert Chen Milos Popovic Dmitriy Lisitsyn Eric Drebitz Iris Grothe Sunita Mandon Andreas Kreiter Udo Ernst Peter A. Robinson Xuelong Zhao Kevin M. Aquino John D. Griffiths Grishma Mehta-Pandejee Natasha Gabay James MacLaurin Somwrita Sarkar Tim Kunze Jens Haueisen Thomas R. Knösche Subutai Ahmad Yuwei Cui Marcus Lewis Jeff Hawkins Simona Olmi Spase Petkoski Fabrice Bartolomei Maxime Guye Viktor Jirsa Hazem Toutounji Daniel Durstewitz Matteo Cantarelli Adrian Quintana Boris Marin Matt Earnshaw Padraig Gleeson Robert Court Robert McDougal R. Angus Silver Salvador Dura-Bernal Stephen Larson William W. Lytton Giovanni Idili Lorenzo Posani Simona Cocco Karel Ježek Rémi Monasson School of Psychology Faculty of Health & Human Sciences Plymouth University Plymouth Devon PL4 8AA UK Institute of Molecular Biology and Biotechnology (IMBB) Foundation for Research and Technology-Hellas (FORTH) Heraklion Crete Greece Okinawa Institute of Science and Technology Graduate University Okinawa Japan Wellcome Trust Centre for Neuroimaging Institute of Neurology UCL London WC1N 3BG UK School of Engineering and Informatics University of Sussex Brighton BN1 9QJ UK Graduate School Okinawa Institute of Science and Technology Okinawa 904-0495 Japan Computational Neuroscience Unit Okinawa Institute of Science and Technology Okinawa 904-0495 Japan Cognitive Neuroscience Area Scuola Internazionale Superiore di Studi Avanzati Trieste 34136 Italy Kavli Institute for Systems Neuroscience NTNU Trondheim 7030 Norway Institut de la Vision Sorbonne Universités UPMC Univ Paris 06 INSERM CNRS Paris 75012 France Department of Engineering University of Cambridge Cambridge Cambridgeshire CB2 1PZ UK Ernst Strüngmann Institute for Neuroscience Max Planck Society Frankfurt Germany Frankfurt Institute for Advanced Studies Frankfurt Germany Neural Systems Analysis Research Center Caesar An Associate of the Max Planck Society Bonn Germany Max Planck Institute for Biological Cybernetics Tübingen Germany Bernstein Center for Computational Neuroscience Tübingen Germany Present Address: Biomedical Engineering Department Georgia Institute of Technology Atlanta GA 30306 USA Department of Neurobiology University of Chicago Chicago IL 60637 USA Department of Organismal Biology and Anatomy University of Chicago Chicago IL 60637 USA Committee on Computational Neuroscience University of Chicago Chicago IL 60637 USA Institut de la Vision Sorbonne Universités INSERM Paris France Laboratoire de Physique Statistique Ecole Normale Supérieure Paris France Institute of Molecular Life Sciences University of Zürich 8057 Zürich Switzerland Institute of Neuroinformatics Univer

来源：评论

学校读者我要写书评

暂无评论

Interaction and architectural space

Interaction and architectural space

引用

32nd Annual ACM Conference on Human Factors in Computing systems, CHI EA 2014

作者： Dalton, Nick Hölscher, Christoph Green, Keith Evan Mathew, Anijo Dalton, Ruth Schnädelbach, Holger Wiberg, Mikael Varoudis, Tasos Department of Computing Open University Milton Keyens United Kingdom Department of Humanities Social and Political Sciences ETH Zürich Zürich Switzerland Institute for Intelligent Materials Systems and Environments Clemson University Clemson SC United States Institute of Design Ilinois Institute of Technology Chicago IL United States Department of Architecture Northumbria University Newcastle United Kingdom School of Computer Science University of Nottingham Nottingham United Kingdom Department of Informatics Umeå University 901 87 Umeå Sweden Space Group University College London London United Kingdom

ISBN: (纸本)9781450324748

For many in the field of HCI, location and space are synonymous;yet, as we move from the mobile era to the ubiquitous era, computing becomes entangled with notions of space. This workshop critically examines the role of space in human-computer interfaces. The objective is to bring together diverse perspectives of space, drawing from architecture, philosophy, art, geography, design, dance, spatial-cognition, mathematics, computing, and still other domains, towards foregrounding space in theoretical discussions and explorations within the CHI community. Expected outcomes are the reporting of fresh insights into the impact and role of space in the interaction process.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of computational approaches to solve Multiple Sequence Alignment

Performance analysis of computational approaches to solve Mu...

引用

作者： Montañola, Alberto Roig, Concepció Guirado, Fernando Hernández, Porfidio Notredame, Cedric Distributed Computing Group Computer Science and Industrial Engineering Department Universitat de Lleida Lleida Spain Computer Architecture and Operating Systems Department Universitat Autònoma de Barcelona Cerdanyola del Vallès Spain Barcelona Spain

In the biotechnology field, the deployment of the Multiple Sequence Alignment (MSA) problem, which is a high performance computing demanding process, is one of the new challenges to address on the new parallel systems. The aim of this problem is to find similar regions on biological sequences. Furthermore, the goal of MSA applications is to align as much sequences as possible with a level of quality that makes the alignment biologically meaningful. An efficiency study of different MSA implementations, based on T-Coffee (one of the most used MSA aligners), has been performed in order to find new optimizations that may improve the average execution time on multi-core systems. We found that the current parallel implementations have some performance issues, affecting negatively the scalability of the process. Finally, the proposed implementation based on the usage of threads in conjunction with a message-passing library is presented, with the aim to optimize the execution of the MSA problem in multi-core-based clusters. © 2012 Springer science+Business Media, LLC.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Designing an SLA protocol with renegotiation to maximize revenues for the CMAC platform

引用

Combined Workshops on Web Information systems Engineering, WISE 2011 and WISE 2012

作者： Galati, Adriano Djemame, Karim Fletcher, Martyn Jessop, Mark Weeks, Michael Hickinbotham, Simon McAvoy, John Collaborative Systems and Performance Group School of Computing University of Leeds LS2 9JT United Kingdom Advanced Computer Architecture Group Department of Computer Science University of York YO10 5DD United Kingdom Cybula Ltd. R and D Team Science Park York YO10 5DD United Kingdom

ISBN: (纸本)9783642383328

The emerging transformation from a product oriented economy to a service oriented economy based on Cloud environments envisions new scenarios where actual QoS mechanisms need to be redesigned. In such scenarios new models to negotiate and manage Service Level Agreements (SLAs) are necessary. An SLA is a formal contract which defines acceptable service levels to be provided by the Service Provider to its customers in measurable terms. This is meant to guarantee that consumers' service quality expectation can be achieved. In fact, the level of customer satisfaction is crucial in Cloud environments, making SLAs one of the most important and active research topics. The aim of this paper is to explore the possibility of integrating an SLA approach for Cloud services based on the CMAC (Condition Monitoring on A Cloud) platform which offers condition monitoring services in cloud computing environments to detect events on assets as well as data storage services. © 2013 Springer-Verlag.

关键词： Customer satisfaction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：