95,788 Hits in 4.2 sec

Distributed Tree Comparison with Nodes of Limited Memory [chapter]

Emanuele Guido Fusco, Andrzej Pelc
2010 Lecture Notes in Computer Science  
Nodes are modeled as identical automata, and our goal is to establish tradeoffs between the memory size of such an automaton and the efficiency of distributed tree comparison, measured either by the time  ...  We consider the task of comparing two rooted trees with port labelings.  ...  We conclude this section by establishing the following matching lower bound on the time of tree comparison with x bits of memory at nodes. Theorem 2.  ... 
doi:10.1007/978-3-642-13284-1_12 fatcat:23ymulhtv5hbneuj4seduolaey

Distributed tree comparison with nodes of limited memory

Emanuele G. Fusco, Andrzej Pelc
2012 Networks  
Nodes are modeled as identical automata, and our goal is to establish tradeoffs between the memory size of such an automaton and the efficiency of distributed tree comparison, measured either by the time  ...  We consider the task of comparing two rooted trees with port labelings.  ...  We conclude this section by establishing the following matching lower bound on the time of tree comparison with x bits of memory at nodes. Theorem 2.  ... 
doi:10.1002/net.21463 fatcat:3xwuhphpvrfnbm6ohofennixlm

Maximal Entropy Reduction Algorithm for SAR ADC Clock Compression [article]

Arkady Molev-Shteiman, Xiao-Feng Qi
2018 arXiv   pre-print
Reduction of comparison cycles leads to power savings of a successive-approximation-register (SAR) analog-to-digital converters (ADC).  ...  We establish that the lowest average number of comparison cycles of a SAR ADC approaches the entropy of the ADC output, and proposed a simple adaptive algorithm that approaches this lower bound.  ...  The flowchart of MER search algorithm with decision tree memory implementation is shown in Figure 5 .  ... 
arXiv:1811.11102v1 fatcat:tx7yivq6arelpdxdmgnhesswgu

An SDN based CBT for Distributed Shared Memory

Qiang Gao, Weiqin Tong, Samina Kausar, Shengan Zheng
2016 International Journal of Grid and Distributed Computing  
These properties make it significant for distributed shared memory. However, such solution has limited control on response time and process scheduling.  ...  The dynamic core-based tree algorithm builds a multicast tree for every multicast group, hereby, SDN controller dynamically adjusts multicast tree according to joining or leaving of nodes.  ...  [7] proposed a real-time operating system with distributed shared memory.  ... 
doi:10.14257/ijgdc.2016.9.1.18 fatcat:lfg554verjhsncdgv72as6ft2m

Dynamic load balancing algorithm for large data flow in distributed complex networks

Zhuo Zhang
2018 Open Physics  
By introducing the relationship between nodes and the children of their brother nodes, we reduce the height of the whole sorted binary tree.  ...  Obviously, it is very important to cooperate with these independent computers to accomplish processing tasks efficiently, which is the function of load balancing.  ...  Common operation of algorithm The key for this algorithm is to count the number of nodes and limit the height of the binary tree by the constraint relationship between the number of nodes.  ... 
doi:10.1515/phys-2018-0089 fatcat:uze6lojkbfdxdj7hr3wolmyy5e

Range Trees with variable length comparisons

Ioannis Sourdis, Ruben de Smet, Georgi N. Gaydadjiev
2009 2009 International Conference on High Performance Switching and Routing  
The proposed Range Tree with variable-length comparisons (RT-VLC) has up to 50% less tree-levels than the original Range Tree and its memory requirements are 50% to 2× that of a linear search approach.  ...  In so doing, for a given memory bandwidth, we achieve a larger number of concurrent comparisons than the original Range Tree. This results in less memory accesses and lower latency per lookup.  ...  On the other hand, Range Trees are balanced and hence have lower latency [6] , but the number of node branches is limited to the ratio of memory bandwidth to address width.  ... 
doi:10.1109/hpsr.2009.5307427 fatcat:nialpaok3nfsjeypnrj6qdpg7y


Takeshi Yamamuro, Makoto Onizuka, Toshio Hitaka, Masashi Yamamuro
2012 Proceedings of the 15th International Conference on Extending Database Technology - EDBT '12  
Our state-of-the-art index structure, called VAST-Tree, classies branch nodes into multiple layers.  ...  With 2 28 keys, it has roughly 6.0-times and 1.24-times throughput and saves the memory consumption by more than 94.7% and 40.5% as compared to binary trees and FAST, respectively.  ...  The simultaneous key comparison with SIMD instructions is limited to three, because FAST uses a 32bit space for keys with padding areas and SIMD instructions process 128bit data. • FAST does not consider  ... 
doi:10.1145/2247596.2247643 dblp:conf/edbt/YamamuroOHY12 fatcat:aowshe4vfvhrbae2sctirwbqqq

Mondrian Forest for Data Stream Classification Under Memory Constraints [article]

Martin Khannouz, Tristan Glatard
2022 arXiv   pre-print
In particular, we design five out-of-memory strategies to update Mondrian trees with new data points when the memory limit is reached.  ...  We evaluate our algorithms on a variety of real and simulated datasets, and we conclude with recommendations on their use in different situations: the Extend Node strategy appears as the best out-of-memory  ...  The computing platform was obtained with funding from the Canada Foundation for Innovation.  ... 
arXiv:2205.07871v1 fatcat:bghlpufawfg3dpgzyvzosvcax4

Range Tries for scalable address lookup

Ioannis Sourdis, Georgios Stefanakis, Ruben de Smet, Georgi N. Gaydadjiev
2009 Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems - ANCS '09  
Range Trie improves on the existing Range Trees allowing shorter comparisons than the address width. The maximum comparison length in a Range Trie node is ⌈log2(N b − Na)⌉ bits.  ...  In so doing, Range Tries can store in a single tree node more address bounds to be compared.  ...  The number of comparisons per node, however, is limited by the available memory bandwidth, which, consequently, reduces scalability with respect to the address width.  ... 
doi:10.1145/1882486.1882520 dblp:conf/ancs/SourdisSSG09 fatcat:l4jf3lnwnzbgzk4skquocwue4q

A Novel Scalable Architecture of Cloud Storage System for Small Files Based on P2P

Qi-fei Zhang, Xue-zeng Pan, Yan Shen, Wen-juan Li
2012 2012 IEEE International Conference on Cluster Computing Workshops  
The central routing node only stores the status and routing information of all data nodes, which are indexed by the Trie Tree structure, so query time meets the requirement of online query.  ...  Scalability and Latency are the two important performance indicators for the distributed file system, and Google and Apache have achieved a great success with GFS and HDFS when operating big files, but  ...  But the memory consumption of Trie tree exceeds the physical limit of the central node when the system extends, for instance, the number of small files is 1×108 and each leaf takes up 30 Bytes, thus the  ... 
doi:10.1109/clusterw.2012.27 dblp:conf/cluster/ZhangPSL12 fatcat:gaxrlsjqxreixioo5ww4yvi7la


2011 Journal of Bioinformatics and Computational Biology  
in memory.  ...  The use of bootstrap samples and restricted subsets of attributes makes it more powerful than simple ensembles of trees.  ...  Acknowledgments Part of this work was supported by NOIA Fund for Data Mining.  ... 
doi:10.1142/s021972001100546x pmid:21523931 fatcat:df7j5me7sba5hnln2bpkuddczu

Multi-dimensional packet classification on FPGA: 100 Gbps and beyond

Yaxuan Qi, Jeffrey Fong, Weirong Jiang, Bo Xu, Jun Li, Viktor Prasanna
2010 2010 International Conference on Field-Programmable Technology  
Second, a node-merging algorithm is proposed to reduce the number of pipeline stages without significantly increasing the memory requirement.  ...  Our solution is based on HyperSplit, a memory-efficient tree search algorithm. First, we present an efficient pipeline architecture for mapping HyperSplit tree.  ...  Figure 8 . 8 Dual Figure 9 .Figure 11 . 911 Tree heights with and without node-merging Figure 10. Memory usage with and without node-merging Nodes distribution without leaf pushing Figure 12.  ... 
doi:10.1109/fpt.2010.5681492 dblp:conf/fpt/QiFJXLP10 fatcat:rl6ebszy2reirhh327czws5oh4


Sadegh Nobari, Farhan Tauheed, Thomas Heinis, Panagiotis Karras, Stéphane Bressan, Anastasia Ailamaki
2013 Proceedings of the 2013 international conference on Management of data - SIGMOD '13  
it is two orders of magnitude faster when compared to approaches with a similar memory footprint.  ...  In particular, it has a one order of magnitude advantage over the memory-demanding state of the art in terms of number of comparisons (i.e., pairwise object comparisons), as well as execution time, while  ...  distributes the objects of dataset B to the nodes of the tree based on the nodes' MBRs.  ... 
doi:10.1145/2463676.2463700 dblp:conf/sigmod/NobariTHKBA13 fatcat:pdur7t7cxbasnfc6vqsehbulaq

EVFDT: An Enhanced Very Fast Decision Tree Algorithm for Detecting Distributed Denial of Service Attack in Cloud-Assisted Wireless Body Area Network

Rabia Latif, Haider Abbas, Seemab Latif, Ashraf Masood
2015 Mobile Information Systems  
To analyze the performance of EVFDT, four metrics are evaluated: classification accuracy, tree size, time, and memory.  ...  The detection of such attacks demands an adaptive and incremental learning classifier capable of accurate decision making with less computation.  ...  Acknowledgments The authors would like to extend their sincere appreciation to the Deanship of Scientific Research at King Saud University Mobile Information Systems 13 for its funding of this research  ... 
doi:10.1155/2015/260594 fatcat:up5kz3dmlfbarollnu6hvnv7wa

Bounding volume hierarchies versus kd-trees on contemporary many-core architectures

Marek Vinkler, Vlastimil Havran, Jiří Bittner
2014 Proceedings of the 30th Spring Conference on Computer Graphics - SCCG '14  
We present a performance comparison of bounding volume hierarchies and kd-trees for ray tracing on many-core architectures (GPUs).  ...  Kd-trees, on the other hand, have higher performance for complex scenes, in particular for those with occlusion.  ...  This research was supported by the Czech Science Foundation under research programs P202/12/2413 (Opalis) and the Grant Agency of the Czech Technical University in Prague, grant No.  ... 
doi:10.1145/2643188.2643196 dblp:conf/sccg/VinklerHB14 fatcat:gec7qk4f7bfpnlxzpchsrjgtly
« Previous Showing results 1 — 15 out of 95,788 results