608 Hits in 3.4 sec

Scan chain clustering for test power reduction

Melanie Elm, Hans-Joachim Wunderlich, Michael E. Imhof, Christian G. Zoellin, Jens Leenstra, Nicolas Maeding
2008 Proceedings of the 45th annual conference on Design automation - DAC '08  
The approach does not specify any ordering inside the chains and fits seamlessly to any standard tool for scan chain integration.  ...  An effective technique to save power during scan based test is to switch off unused scan chains.  ...  Chapter 3 presents an efficient hyper-graph based partitioning algorithm.  ... 
doi:10.1145/1391469.1391680 dblp:conf/dac/ElmWIZLM08 fatcat:byctuduk2rat3istfk5ttneb3a


Matthias Boehm, Arvind C. Surve, Shirish Tatikonda, Michael W. Dusenberry, Deron Eriksson, Alexandre V. Evfimievski, Faraz Makari Manshadi, Niketan Pansare, Berthold Reinwald, Frederick R. Reiss, Prithviraj Sen
2016 Proceedings of the VLDB Endowment  
covering linear algebra primitives and statistical functions, and (2) transparently running these ML algorithms on distributed, data-parallel frameworks by applying cost-based compilation techniques to  ...  The rising need for custom machine learning (ML) algorithms and the growing data sizes that require the exploitation of distributed, data-parallel frameworks such as MapReduce or Spark, pose significant  ...  Kadner, Jihyoung Kim, Narine Kokhlikyan, Deepak Kumar, Min Li, Luciano Resende, Alok Singh, Glenn Weidner, and Wen Pei Yu for their significant contributions to SystemML.  ... 
doi:10.14778/3007263.3007279 fatcat:vkwv56agrje47he2tizhfyu7u4

Scalable all-pairs similarity search in metric spaces

Ye Wang, Ahmed Metwally, Srinivasan Parthasarathy
2013 Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD '13  
in the presence of limited computing resources; iii) an on-thefly lossless compression strategy to reduce both the running time and the final output size.  ...  Novel elements of our solution include: i) flexible support for multiple metrics of interest; ii) an autonomic approach to partition the input dataset with minimal redundancy to achieve good load-balance  ...  ACKNOWLEDGEMENTS YW and SP acknowledge support from a Google Research Award and NSF Grant IIS-0917070, and the suggestions from Yang Zhang, Dave Fuhry and Tyler Clemons.  ... 
doi:10.1145/2487575.2487625 dblp:conf/kdd/WangMP13 fatcat:5vtxulyq2rhf7joiossq46beu4

Mutual exclusion scheduling with interval graphs or related classes. Part II

Frédéric Gardi
2008 Discrete Applied Mathematics  
Moreover, all our proofs are constructive and provide efficient algorithms to solve the MES problem for these graphs, given a coloring satisfying the condition in input.  ...  Given a simple and undirected graph G and an integer k, the problem is to find a minimum coloring of G such that each color is used at most k times.  ...  We also express our gratitude to the two anonymous referees for their reviewing, which has resulted in an improved paper.  ... 
doi:10.1016/j.dam.2007.08.017 fatcat:qhthu75v4fbpvowcxtux4v2lzm

Fast algorithms for universal quantification in large databases

Goetz Graefe, Richard L. Cole
1995 ACM Transactions on Database Systems  
Thus, existential and universal quantification can be supported with equal efficiency by adding the recently proposed algorithm to a query evaluation system.  ...  In this article, we describe and compare three known algorithms and one recently proposed algorithm for relational division, the algebra operator that embodies universal quantification.  ...  Volcano provides an extensible set of algorithms and mechanisms for efficient query processing [Graefe 1994].  ... 
doi:10.1145/210197.210202 fatcat:joso33b7ajdcra4b7br23ho7jy

Parallel Index-based Stream Join on a Multicore CPU [article]

Amirhesam Shahvarani, Hans-Arno Jacobsen
2019 arXiv   pre-print
Our experiments using an octa-core processor show that our parallel stream join achieves up to 5.5 times higher throughput than a single-threaded approach.  ...  To complement the index, we design an algorithm to realize a parallel index-based stream join that exploits the computational power of multicore processors.  ...  Consequently, the gap between edge-tuple and sliding window head increases, which causes more costly linear scans and consequently a less efficient window lookup.  ... 
arXiv:1903.00452v1 fatcat:xqf7zbvkeffo5bg277anze3roa

An overview of query optimization in relational systems

Surajit Chaudhuri
1998 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '98  
It takes a parsed representation of a SQL query as input and is responsible for generating an efficient execution plan for the given SQL query from the space of possible execution plans.  ...  Over time, SQL [41] has emerged as the standard for relational query languages.  ...  The System-R join enumerator that we discussed in Section 3 was designed to choose only an optimal linear join order.  ... 
doi:10.1145/275487.275492 dblp:conf/pods/Chaudhuri98 fatcat:6ug5xutc4rgzlg5y32uzsyzpla


Magdy A. Bayoumi, Bertrand Zavidovique
2005 EURASIP Journal on Advances in Signal Processing  
The main requirements of such perception systems include (i) intelligent and computational sensors; (ii) perception and sensing algorithms; (iii) vision-based algorithms; for example, collision avoidance  ...  Having sensing, processing, and displaying on a single chip will lead to optimal performance.  ...  Such computation is efficiently performed on a scan-plus version of the input image that commutes with the DCT in a JPEG compression since both are linear.  ... 
doi:10.1155/asp.2005.989 fatcat:olvmijwcwfhm3ndta6te4b64hq

SPARQL Graph Pattern Processing with Apache Spark

Hubert Naacke, Bernd Amann, Olivier Curé
2017 Proceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems - GRADES'17  
We compare five possible implementation and illustrate the importance of cautiously choosing the physical data storage layer and of the possibility to use both join algorithms to efficiently take account  ...  In this article, we study the use of two distributed join algorithms, partitioned join and broadcast join, for the evaluation of BGP expressions on top of Apache Spark.  ...  Efficiently evaluating BGP expressions is essential for all SPARQL query engines and an important challenge for SPARQL query optimizers.  ... 
doi:10.1145/3078447.3078448 dblp:conf/grades/NaackeAC17 fatcat:yi4z2tmprzdvlkgwpebrujgkgy

Modeling, Evaluation and Control of a Road Image Processing Chain [chapter]

Yves Lucas, Antonio Domingues, Driss Driouchi, Pierre Marché
2005 Lecture Notes in Computer Science  
By testing this approach on an IPC dedicated to road obstacle detection, we demonstrate that this experimental methodology and software architecture ensure a steady efficiency.  ...  Tuning a complete image processing chain (IPC) remains a tricky step.  ...  Acknowledgments This research program is supported by the French PREDIT Program and by Europe FSE grant.  ... 
doi:10.1007/11499145_109 fatcat:kkrzdobc5rbohi6gl3dqbpyvfi

CliqueSquare: Flat plans for massively parallel RDF queries

Francois Goasdoue, Zoi Kaoudi, Ioana Manolescu, Jorge-Arnulfo Quiane-Ruiz, Stamatis Zampetakis
2015 2015 IEEE 31st International Conference on Data Engineering  
These architectures are characterized first, by their RDF partitioning and storage method, and second, by their approach for distributed query optimization, i.e., determining which operations to execute  ...  We present a family of optimization algorithms, relying on n-ary (star) equality joins to build flat plans, and compare their ability to find the flattest possibles.  ...  An HO-lossy optimization algorithm may find no HO plan for a query q 1 , some HO plans for another query q 2 and all HO plans for query q 3 .  ... 
doi:10.1109/icde.2015.7113332 dblp:conf/icde/GoasdoueKMQZ15 fatcat:vvikryub6ja4tpkndyjlwhebbu

Triple-C: Resource-usage prediction for semi-automatic parallelization of groups of dynamic image-processing tasks

Rob Albers, Eric Suijs, Peter H.N. de With
2009 2009 IEEE International Symposium on Parallel & Distributed Processing  
We focus on the upper design layers, dealing with the applications and their control for an efficient execution.  ...  Prediction Model of Computation Time As an answer to variable processing rates of the application, performance prediction may be applied in the form of modeling to guide the mapping and to obtain an efficient  ... 
doi:10.1109/ipdps.2009.5160942 dblp:conf/ipps/AlbersSW09 fatcat:alr4qfdv6bhxbojinvactmcc64

Distributed Subtrajectory Join on Massive Datasets [article]

Panagiotis Tampakis, Christos Doulkeridis, Nikos Pelekis, Yannis Theodoridis
2019 arXiv   pre-print
The results show that DTJi performs up to 16x faster compared with DTJb, 10x faster than DTJr and 3x faster than the closest related state of the art algorithm.  ...  In the era of Big Data, the production of mobility data has become massive and, consequently, performing such an operation in a centralized way is not feasible.  ...  We would like to thank the Greek Research and Technology Network (GRNET) for providing access to the Okeanos cloud infrastructure and IMIS Hellas for donating the IMIS dataset.  ... 
arXiv:1903.07748v1 fatcat:hfqetzmnvjcpnk5vlxylxdaoja


Changzhen Qiu, Zhiyong Zhang, Huanzhang Lu, Huiwu Luo
2015 Progress in Electromagnetics Research B  
For each category, this paper provides the detailed descriptions of the representative algorithms, and examines their pros and cons. Finally, new trends for future research directions are offered.  ...  However, no up-to-date survey is available in the literature that can help to select suitable tracking algorithm for practical problem.  ...  To cope with the data association problem, an efficient 2-D assignment algorithm is adopted.  ... 
doi:10.2528/pierb15010503 fatcat:zvucqzcgdjdy5pnvqg6b4mcnye

Adaptive Block and Batch Sizing for Batched Stream Processing System

Quan Zhang, Yang Song, Ramani R. Routray, Weisong Shi
2016 2016 IEEE International Conference on Autonomic Computing (ICAC)  
enables efficient and fault tolerant stream processing.  ...  Given that a time-consuming regression based algorithm can be used, an intuitive way to model the system is to directly use linear or superlinear function to fit a curve with statistics of completed batches  ... 
doi:10.1109/icac.2016.27 dblp:conf/icac/ZhangSRS16 fatcat:3er6legizfeitab7cmrze7n4jq
« Previous Showing results 1 — 15 out of 608 results