A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Scalable Models for Computing Hierarchies in Information Networks
[article]
2016
arXiv
pre-print
Preserved Fulltext
Fortunately, many statistical and computational models exist that automatically generate hierarchies; however, the existing approaches do not consider linkages in information networks that are increasingly ...
Information hierarchies are organizational structures that often used to organize and present large and complex information as well as provide a mechanism for effective human navigation. ...
Like TMN model, Topic-senstive PageRank does not construct any type of information network hierarchy. ...
arXiv:1601.00626v1
fatcat:mul3xqcl3nfi3bsw7vuwa76nge
Page 24 of Journal of Research and Practice in Information Technology Vol. 28, Issue 1
[page]
1996
Journal of Research and Practice in Information Technology
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
There are models where additional model view dependent interface information needs to be added at the cost of possibly reduced scalability. ...
| SR UCT URED GRAPHS: A VISUAL FORMALISM FOR SCALABLE GRAPH BASED CASE TOOLS [es
links), through the use of node and link hierarchies, and automatic derivation of high level views from an underlying network ...
Network protocol scalability via a topological Kadanoff transformation
2008
2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
exists in the network ...
as the key to achieve network addressing scalability [Kleinrock & Kamoun, 1977] -A natural hierarchy of scales can be augmented it with routing protocol rules, yielding a new class of routing protocols ...
Characteristic time-scales of information summarisation correspond to scalable routing overheads: If for a particular network class L = logn as n → ∞, then τ l = τ 0 ·b l , l = 0, ..., L Conclusion ...
doi:10.1109/wiopt.2008.4586133
dblp:conf/wiopt/ConstantinouS08
fatcat:d6w6t4idpzggjb3ay7xiylpxbm
Explicit Management of Memory Hierarchy
[chapter]
1997
Advances in High Performance Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
All scalable parallel computers feature a memory hierarchy, in which some locations are "closer" to a particular processor than others. ...
We describe the shared memory NUMA model implemented in the tools, discuss extensions for wide area computing environments, and review major applications of the tools, which currently total over one million ...
In this paper we discuss the issues of memory hierarchy and data locality in common programming models and describe a set of tools for development of scalable scientific MIMD algorithms that address these ...
doi:10.1007/978-94-011-5514-4_11
fatcat:6yywywktgfawzlqtiwuxjnuch4
Networks Security models Scalability Analysis
2019
Mağallaẗ al-ʿulūm al-handasiyyaẗ wa-al-tiknūlūğiyā al-maʿlūmāt
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this research, the scalability of existing security models is evaluated and compared with the HARM in realistic scenarios. ...
Two main tasks in this research are (1) formulating key questions that need to be answered to assess the scalability of security models, and (2) evaluate and compare the scalability of security models ...
This research shows the scalability of security models used for a large sized Networked system, A performance analysis was conducted to demonstrate how Different security models, namely the HARM and the ...
doi:10.26389/ajsrp.k270119
fatcat:2my5w7hiazbhnm6zlm5pk5uk6y
A hierarchical approach to reducing communication in parallel graph algorithms
2015
Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming - PPoPP 2015
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, distributed graph computations are limited in their scalability and performance due to the heavy communication inherent in such computations. ...
The hierarchical model takes advantage of locale information of the neighboring vertices to reduce communication, both in message volume and total number of bytes sent. ...
of the machine hierarchy and locality information to optimize communication and improve scalability and performance. ...
doi:10.1145/2688500.2700994
dblp:conf/ppopp/HarshvardhanAR15
fatcat:xfa5a2hp2rexflc2yqkhtziaum
A hierarchical approach to reducing communication in parallel graph algorithms
2015
SIGPLAN notices
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, distributed graph computations are limited in their scalability and performance due to the heavy communication inherent in such computations. ...
The hierarchical model takes advantage of locale information of the neighboring vertices to reduce communication, both in message volume and total number of bytes sent. ...
of the machine hierarchy and locality information to optimize communication and improve scalability and performance. ...
doi:10.1145/2858788.2700994
fatcat:ks3hacga4bbttbbkgn3qrwtapy
Capitalizing on Hierarchical Graph Decomposition for Scalable Network Analysis
2018
Very Large Data Bases Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We decompose large networks to reveal the underlying hierarchy and extract signals from this hierarchical topology to solve three network analysis problems viz., network comparison, determining influential ...
We address the computational challenge of analyzing large networks on a single consumer-grade machine. ...
We leverage hierarchy and approximated community structure to develop algorithms for three common problems in network analysis, namely, network comparison, finding influential spreaders and computing node ...
dblp:conf/vldb/Saxena18
fatcat:bjqiez6uufbupd7ggqo6zvaipy
Modeling the Internet Routing Scalability: From Qualitative Description to Quantitative Evaluation
2012
Journal of Convergence Information Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The qualitative analysis in this paper reveals gains and losses of different techniques that aim to improve the scalability of the Internet routing system. ...
In particular, the analysis focuses on techniques of route aggregation, forwarding information base (FIB) compression and route cache mechanism, which correspond to tradeoffs between routing scaling and ...
Introduction The Internet has become the most influential and largest information infrastructure that connects various computer networks all over the world. ...
doi:10.4156/jcit.vol7.issue8.38
fatcat:7nywu2z2nvcwfmff3ed7swy6am
Collective Self-Awareness and Self-Expression for Efficient Network Exploration
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Message broadcasting and topology discovery are classical problems for distributed systems, both of which are related to the concept of network exploration. ...
Decentralized approaches are usually adopted, assuming that network nodes are provided with traditional routing tables. ...
Computer Networks 55(4), ...
doi:10.1007/978-3-319-24309-2_1
fatcat:lgd34266l5bbve5hlfjqvs2qrq
Editorial: communication optimization for scalable parallel system
2012
Journal of Supercomputing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Scalable Parallel System has emerged rapidly as an exciting new paradigm that offers a challenging model of computing and poses fascinating problems regarding communication optimizations, ranging from ...
The first paper entitled "Communication-free data alignment for arrays with exponential references in parallelizing compilers for scalable parallel systems" proposes two alignment techniques to properly ...
active in, application models for scalable and parallel computing and communication systems. ...
doi:10.1007/s11227-012-0744-3
fatcat:fqagtnmyjvg65fq54n5kw4iaf4
Applying analytic hierarchy process to assess healthcare-oriented cloud computing service systems
2016
SpringerPlus
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To evaluate cloud computing service systems for use in health care, providing decision makers with a comprehensive assessment method for prioritizing decision-making factors is highly beneficial. ...
Moreover, because of the financial risks associated with constant changes in healthcare payment methods and constantly evolving information technology, healthcare organizations must continually adjust ...
Acknowledgements This work was supported in part by the Ministry of Science and Technology, Taiwan, under grant MOST104-2221-E-036-005, and Tatung University, under Grants B105-N02-046 and B105-N03-047 ...
doi:10.1186/s40064-016-2686-3
pmid:27441149
pmcid:PMC4938816
fatcat:3h5wqejvona6hnlrmhz77dhub4
Diet: A Scalable Toolbox to Build Network Enabled Servers on the Grid
2006
The international journal of high performance computing applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Network Enabled Servers implement this model also called GridRPC. Clients submit computation requests to a scheduler whose goal is to find a server available on the grid. ...
Les environnements de ce type, connus sous le terme de Network Enabled Servers, implémentent ce modèle appelé GridRPC. ...
In particular, we would like to thank R. ...
doi:10.1177/1094342006067472
fatcat:s4s55jltpvafxipb5c26afdzle
Enabling Hierarchical Exploration for Large-Scale Multidimensional Data with Abstract Parallel Coordinates
2018
International Conference on Extending Database Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Processing scalability is addressed by carrying out computation in a distributed manner on a remote data-intensive infrastructure. ...
Building upon several previous aggregated parallel coordinates representations, we propose a unifying and thinking model for conceiving and describing multiscale parallel coordinates and their interactions ...
The authors would also like to thank the anonymous referees for their valuable comments and helpful suggestions. ...
dblp:conf/edbt/RicherSLAB18
fatcat:ab5ibxqojrcc5eyoj6w2eigwc4
Intelligent Object Locality Naming Model in an Object-Based Distributed System for Engineering Applications
2007
2007 International Conference on Machine Learning and Cybernetics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
An object based distributed system is suitable for such applications due to the inherent parallelism nature in the object based computing model. ...
In this paper, we propose a heuristic distributed search algorithm, the hierarchy random walker (HRW), to take advantage of the locality of object communications thereby increasing the overall system performance ...
Hierarchy Random Walkers Issues concerning search in power-law networks have been studied in [14, 15] . ...
doi:10.1109/icmlc.2007.4370127
fatcat:orpuj7oiqrfgjer7osejskowtu
« Previous
Showing results 1 — 15 out of 52,937 results