To see the other types of publications on this topic, follow the link: High Performance Networking.
Dissertations / Theses on the topic 'High Performance Networking'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 32 dissertations / theses for your research on the topic 'High Performance Networking.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Wallach, Deborah A. (Deborah Anne). "High-performance application-specific networking." Thesis, Massachusetts Institute of Technology, 1997. http://hdl.handle.net/1721.1/10261.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1997.Includes bibliographical references (p. 107-112).
by Deborah Anne Wallach.
Ph.D.
2
Mehta, Anil. "MAC AND APPLICATION LAYER PROTOCOLS FOR HIGH PERFORMANCE NETWORKING." OpenSIUC, 2011. https://opensiuc.lib.siu.edu/dissertations/396.
Full textAbstract:
High-performance networking (HPN) is of significance today in order to enable next-generation applications using wired and wireless networks. Some of the examples of HPN include low-latency industrial sensing, monitoring and automation using Wireless Sensor Networks (WSNs). HPN however requires protocol optimization at many layers of the open system interface (OSI) network model in order to meet the stringent performance constraints of the given applications. Furthermore, these protocols need to be impervious to denial of service (DoS) and distributed DoS (DDoS) attacks. Some of the key performance aspects of HPN are low point-to-point and end-to-end latency, high reliability of transmitted frames and performance predictability under various network load situations. This work focuses on two discrete issues in designing protocols for HPN applications. The first research issue looks at the Medium Access Control (MAC) layer of the OSI network model for designing of MAC protocols that provide low-latency and high reliability for point-to-point communication under a WSN. Existing standards in this area are governed by IEEE 802.15.4 specification which defines protocols for MAC and PHY layers for short-range, low bit-rate, and low-cost wireless networks. However, the IEEE 802.15.4 specification is inefficient in terms of latency and reliability performance and, as a result, is unable to meet the stringent operational requirements as defined by counterpart wired sensor networks. Work presented under current research issue describes new MAC protocols that are able to show low-latency transmission performance under strict timing constants for power limited WSNs. This enhancement of the MAC protocols is named extended GTS (XGTS) contained under extended CFP (ECFP) and is published under the IEEE's 802.15.4e standard. The second research issue focuses on the application layer of the OSI network model to design protocols that enhance the robustness of the text based protocols to various traffic inputs. The purpose of this is to increase the reliability of the given text based application layer protocol under a varied load. Session Initiation Protocol (SIP) is used as a case study and the work aims to build algorithms that ensure that SIP can continue to function under specific traffic conditions, which would otherwise deem the protocol useless due to DoS and DDoS attacks. Proposed algorithms investigate techniques that enhance the robustness of the SIP against parsing attacks without performing a deep parse of the protocol data unit (PDU). The desired effect of this is to reduce the time spent in parsing the SIP messages at a SIP router and as a result increase the number of SIP messages processed per unit time at a SIP router.
3
Valente, Fredy Joao. "An integrated parallel/distributed environment for high performance computing." Thesis, University of Southampton, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362138.
Full text
4
Ahmad, R. Badlishah. "Performance analysis of optical buffered switching nodes in ultra high speed networking." Thesis, University of Strathclyde, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.367046.
Full text
5
Neel, Brian. "High Performance Shared Memory Networking in Future Many-core Architectures UsingOptical Interconnects." Ohio University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1397488118.
Full text
6
Ansary, B. M. Saif. "High Performance Inter-kernel Communication and Networking in a Replicated-kernel Operating System." Thesis, Virginia Tech, 2016. http://hdl.handle.net/10919/78338.
Full textAbstract:
Modern computer hardware platforms are moving towards high core-count and heterogeneous Instruction Set Architecture (ISA) processors to achieve improved performance as single core performance has reached its performance limit. These trends put the current monolithic SMP operating system (OS) under scrutiny in terms of scalability and portability. Proper pairing of computing workloads with computing resources has become increasingly arduous with traditional software architecture.
One of the most promising emerging operating system architectures is the Multi-kernel. Multi-kernels not only address scalability issues, but also inherently support heterogeneity. Furthermore, provide an easy way to properly map computing workloads to the correct type of processing resources in presence of heterogeneity. Multi-kernels do so by partitioning the resources and running independent kernel instances and co-operating amongst themselves to present a unified view of the system to the application. Popcorn is one the most prominent multi-kernels today, which is unique in the sense that it runs multiple Linux instances on different cores or group of cores, and provides a unified view of the system i.e., Single System Image (SSI).
This thesis presents four contributions. First, it introduces a filesystem for Popcorn, which is a
vital part to provide a SSI. Popcorn supports thread/process migration that requires migration of file descriptors which is not provided by traditional filesystems as well as popular distributed file systems, this work proposes a scalable messaging based file descriptor migration and consistency protocol for Popcorn.
Second, multi-kernel OSs rely heavily on a fast low latency messaging layer to be scalable. Messaging is even more important in heterogeneous systems where different types of cores are on different islands with no shared memory. Thus, another contribution proposes a fast-low latency messaging layer to enable communication among heterogeneous processor islands for Heterogeneous Popcorn.
With advances in networking technology, newest Ethernet technologies are able to support up to 40 Gbps bandwidth, but due to scalability issues in monolithic kernels, the number of connections served per second does not scale with this increase in speed.Therefore, the third and fourth contributions try to address this problem with Snap Bean, a virtual network device and Angel, an opportunistic load balancer for Popcorn's network system.
With the messaging layer Popcorn gets over 30% performance benefit over OpenCL and Intel
Offloading technique (LEO). And with NetPopcorn we achieve over 7 to 8 times better performance over vanilla Linux and 2 to 5 times over state-of-the-art Affinity Accept .Master of Science
7
Jamaliannasrabadi, Saba. "High Performance Computing as a Service in the Cloud Using Software-Defined Networking." Bowling Green State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1433963448.
Full text
8
Ranadive, Adit Uday. "Virtualized resource management in high performance fabric clusters." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54241.
Full textAbstract:
Providing performance and isolation guarantees for applications running in virtualized
datacenter environments requires continuous management of the underlying physical
resources. For communication- and I/O-intensive applications running on such platforms,
the management methods must adequately deal with the shared use of the high-performance
fabrics these applications require. In particular, new classes of latency-sensitive and
data-intensive workloads running in virtualized environments rely on emerging fabrics
like 40+Gbps Ethernet and InfiniBand/RoCE with support for RDMA, VMM-bypass and
hardware-level virtualization (SR-IOV). However, the benefits provided by these technology
advances are offset by several management constraints: (i) the inability of the hypervisor
to monitor the VMs’ usage of these fabrics can affect the platform’s ability to provide
isolation and performance guarantees, (ii) the hypervisor cannot provide fine-grained
I/O provisioning or perform management decisions for VMs, thus reducing the degree of
consolidation that can be supported on the platforms, and (iii) without such support it
is harder to integrate these fabrics into emerging cloud computing platforms and
datacenter fabric management solutions. This is made particularly challenging for
workloads spanning multiple VMs, utilizing physical resources distributed across multiple
server nodes and the interconnection fabric.
This thesis addresses the problem of realizing a flexible, dynamic resource management
system for virtualized platforms with high performance fabrics. We make the following key
contributions:
(i) A lightweight monitoring tool, IBMon, integrated with the hypervisor to monitor VMs’
use of RDMA-enabled virtualized interconnects, using memory introspection techniques.
(ii) The design and construction of a resource management system that leverages IBMon
to provide latency-sensitive applications performance guarantees. This system is built
on microeconomic principles of supply and demand and can be deployed on a per-node
(Resource Exchange) or a multi-node (Distributed Resource Exchange) basis. Fine-grained
resource allocations can be enforced through several mechanisms, including CPU capping
or fabric-level congestion control.
(iii) Sphinx, a fabric management solution that leverages Resource Exchange to orchestrate
network and provide latency proportionality for consolidated workloads, based on
user/application-specified policies.
(iv) Implementation and experimental evaluation using InfiniBand clusters virtualized with
the Xen or KVM hypervisor, managed via the OpenFloodlight SDN controller, and using
representative data-intensive and latency-sensitive benchmarks.
9
Hsieh, Cheng-Liang. "Design and Implementation of Scalable High-Performance Network Functions." OpenSIUC, 2017. https://opensiuc.lib.siu.edu/dissertations/1416.
Full textAbstract:
Service Function Chaining (SFC) enriches the network functionalities to fulfill the increasing demand of value-added services. By leveraging SDN and NFV for SFC, it becomes possible to meet the demand fluctuation and construct a dynamic SFc. However, the integration of SDN with NFV requires packet header modifications, generates excessive network traffics, and induces additional I/O overheads for packet processing. These additional overheads result in a lower system performance, scalability, and agility. To improve the system performance, a co-optimized solution is proposed to implemented NF to achieve a better performance for software-based network functions. To improve the system scalability, a many-field packet classification is proposed to support a more complex ruleset. To improve the system agility, a network function-enabled switch is proposed to lower the network function content switching time. The experiment results show that the performance of a network function is improved by 8 times by leveraging GPU as a parallel computation platform. Moreover, the matching speed to steer network traffics with many-field ruleset is improved by 4 times with the proposed many-field packet classification algorithm. Finally, the proposed system is able to improve system bandwidth 5 times better compared the native solution and maintain the content switch time with the proposed SFC implementation using SDN and NFV.
10
Ahmed, Kishwar. "Energy Demand Response for High-Performance Computing Systems." FIU Digital Commons, 2018. https://digitalcommons.fiu.edu/etd/3569.
Full textAbstract:
The growing computational demand of scientific applications has greatly motivated the development of large-scale high-performance computing (HPC) systems in the past decade. To accommodate the increasing demand of applications, HPC systems have been going through dramatic architectural changes (e.g., introduction of many-core and multi-core systems, rapid growth of complex interconnection network for efficient communication between thousands of nodes), as well as significant increase in size (e.g., modern supercomputers consist of hundreds of thousands of nodes). With such changes in architecture and size, the energy consumption by these systems has increased significantly. With the advent of exascale supercomputers in the next few years, power consumption of the HPC systems will surely increase; some systems may even consume hundreds of megawatts of electricity. Demand response programs are designed to help the energy service providers to stabilize the power system by reducing the energy consumption of participating systems during the time periods of high demand power usage or temporary shortage in power supply.
This dissertation focuses on developing energy-efficient demand-response models and algorithms to enable HPC system's demand response participation. In the first part, we present interconnection network models for performance prediction of large-scale HPC applications. They are based on interconnected topologies widely used in HPC systems: dragonfly, torus, and fat-tree. Our interconnect models are fully integrated with an implementation of message-passing interface (MPI) that can mimic most of its functions with packet-level accuracy. Extensive experiments show that our integrated models provide good accuracy for predicting the network behavior, while at the same time allowing for good parallel scaling performance. In the second part, we present an energy-efficient demand-response model to reduce HPC systems' energy consumption during demand response periods. We propose HPC job scheduling and resource provisioning schemes to enable HPC system's emergency demand response participation. In the final part, we propose an economic demand-response model to allow both HPC operator and HPC users to jointly reduce HPC system's energy cost. Our proposed model allows the participation of HPC systems in economic demand-response programs through a contract-based rewarding scheme that can incentivize HPC users to participate in demand response.
11
Chunangad, Narayanaswamy Ganesh. "On the Interaction of High-Performance Network Protocol Stacks with Multicore Architectures." Thesis, Virginia Tech, 2008. http://hdl.handle.net/10919/32113.
Full textAbstract:
Multicore architectures have been one of the primary driving forces in the recent rapid growth
in high-end computing systems, contributing to its growing scales and capabilities. With significant
enhancements in high-speed networking technologies and protocol stacks which support these high-end systems, a growing need to understand the interaction between them closely is realized.
Since these two components have been designed mostly independently, there tend to have often
serious and surprising interactions that result in heavy asymmetry in the effective capability of the
different cores, thereby degrading the performance for various applications. Similarly, depending
on the communication pattern of the application and the layout of processes across nodes, these
interactions could potentially introduce network scalability issues, which is also an important concern for system designers.
In this thesis, we analyze these asymmetric interactions and propose and design a novel systems level management framework called SIMMer (Systems Interaction Mapping Manager) that
automatically monitors these interactions and dynamically manages the mapping of processes on
processor cores to transparently maximize application performance. Performance analysis of SIMMer shows that it can improve the communication performance of applications by more than twofold
and the overall application performance by 18%. We further analyze the impact of contention in network and processor resources and relate it to the communication pattern of the application.
Insights learnt from these analyses can lead to efficient runtime configurations for scientific applications on multicore architectures.
Master of Science
12
Zhang, Jie Zhang. "Designing and Building Efficient HPC Cloud with Modern Networking Technologies on Heterogeneous HPC Clusters." The Ohio State University, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=osu1532737201524604.
Full text
13
Li, Mingzhe. "Designing High-Performance Remote Memory Access for MPI and PGAS Models with Modern Networking Technologies on Heterogeneous Clusters." The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1512070491037985.
Full text
14
Hillyer, Bridget. "On the Performance Evaluation of High-Speed Transport Protocols." UNF Digital Commons, 2006. http://digitalcommons.unf.edu/etd/359.
Full textAbstract:
As high-speed networks with large bandwidth delay products (BDP) become more common, high-speed transport protocols must be developed that perform well in these contexts. TCP has limitations in high BDP networks. A number of high-speed TCP proposals have emerged, including BIC TCP, High Speed TCP, and H-TCP. XCP is an intraprotocol communication mechanism that promises even greater performance by providing explicit feedback from routers about congestion. It requires changes to routers and end hosts, though, whereas the other experimental protocols only require changes to an end host. We evaluated the performance ofXCP against BIC TCP, High Speed TCP, H-TCP, and . NewReno TCP. We found that in a controlled environment, XCP gave much better performance than the other TCPs. XCP was sensitive to misconfiguration and environmental factors, though, and was more difficult to deploy. More work is required to make XCP more stable. The other TCPs did not perform better than NewReno TCP but show promise, as most performed almost as well as NewReno TCP.
15
Trahay, François. "De l’interaction des communications et de l’ordonnancement de threads au sein des grappes de machines multi-cœurs." Thesis, Bordeaux 1, 2009. http://www.theses.fr/2009BOR13870/document.
Full textAbstract:
La tendance actuelle des constructeurs pour le calcul scientifique est à l'utilisation de grappes de machines dont les noeuds comportent un nombre de coeurs toujours plus grand. Le modèle basé uniquement sur MPI laisse peu à peu la place à des modèles mélangeant l'utilisation de threads et de MPI. Ce changement de modèle entraîne de nombreuses problématiques car les implémentations MPI n'ont pas été conçues pour supporter les applications multi-threadées. Dans cette thèse, afin de garantir le bon fonctionnement des communications, nous proposons un module logiciel faisant interagir l'ordonnanceur de threads et la bibliothèque de communication. Ce gestionnaire d'entrées/sorties générique prend en charge la détection des événements du réseau et exploite les multiples unités de calcul présentes sur la machine de manière transparente. Grâce à la collaboration étroite avec l'ordonnanceur de threads, le gestionnaire d'entrées/sorties que nous proposons assure un haut niveau de réactivité aux événements du réseau. Nous montrons qu'il est ainsi possible de faire progresser les communications réseau en arrière-plan et donc de recouvrir les communications par du calcul. La parallélisation de la bibliothèque de communication est également facilité par un mécanisme d'exportation de tâches capable d'exploiter les différentes unités de calcul disponible tout en prenant en compte la localité des données. Les gains obtenus sur des tests synthétiques et sur des applications montre que l'interaction entre la bibliothèque de communication et l'ordonnanceur de threads permet de réduire le coût des communications et donc d'améliorer les performances d'une applicationThe current trend of constructors for scientific computation is to build clusters whose node include an increasing number of cores.The classical programming model that is only based on MPI is being replaced by hybrid approaches that mix communication and multi-threading. This evolution of the programming model leads to numerous problems since MPI implementations were not designed for multi-threaded applications. In this thesis, in order to guarantee a smooth behavior of communication, we propose a software module that interact with both the threads scheduler and the communication library. This module, by working closely with the thread scheduler, allows to make communication progress in the background and guarantees a high level of reactivity to network events, even when the node is overloaded. We show that this permits to make communication progress in the background and thus to overlap communication and computation. The parallelization of the communication library is also made easier thanks to a task onloading mechanism that is able to exploit the available cores while taking data locality into account. The results we obtain on synthetic application as well as real-life applications show that the interaction between the thread scheduler and the communication library allows to reduce the overhead of communication and thus to improve the application performance
16
Mani, Sindhu. "Empirical Performance Analysis of High Performance Computing Benchmarks Across Variations in Cloud Computing." UNF Digital Commons, 2012. http://digitalcommons.unf.edu/etd/418.
Full textAbstract:
High Performance Computing (HPC) applications are data-intensive scientific software requiring significant CPU and data storage capabilities. Researchers have examined the performance of Amazon Elastic Compute Cloud (EC2) environment across several HPC benchmarks; however, an extensive HPC benchmark study and a comparison between Amazon EC2 and Windows Azure (Microsoft’s cloud computing platform), with metrics such as memory bandwidth, Input/Output (I/O) performance, and communication computational performance, are largely absent. The purpose of this study is to perform an exhaustive HPC benchmark comparison on EC2 and Windows Azure platforms.
We implement existing benchmarks to evaluate and analyze performance of two public clouds spanning both IaaS and PaaS types. We use Amazon EC2 and Windows Azure as platforms for hosting HPC benchmarks with variations such as instance types, number of nodes, hardware and software. This is accomplished by running benchmarks including STREAM, IOR and NPB benchmarks on these platforms on varied number of nodes for small and medium instance types. These benchmarks measure the memory bandwidth, I/O performance, communication and computational performance. Benchmarking cloud platforms provides useful objective measures of their worthiness for HPC applications in addition to assessing their consistency and predictability in supporting them.
17
Huff, John D. "Performance Characteristics of the Interplanetary Overlay Network in 10 Gbps Networks." Ohio University / OhioLINK, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1619115602389023.
Full text
18
Brunet, Elisabeth. "Une approche dynamique pour l'optimisation des communications concurrentes sur réseaux hautes performance." Thesis, Bordeaux 1, 2008. http://www.theses.fr/2008BOR13721/document.
Full textAbstract:
Cette thèse cherche à optimiser les communications des applications de calcul intensif s'exécutant sur des grappes de PC. En raison de l'usage massif de processeurs multicoeurs, il est désormais impératif de gérer un grand nombre de flux de communication concurrents. Nous avons mis en évidence et analysé les performances décevantes des solutions actuelles dans un tel contexte. Nous avons ainsi proposé une architecture de communication centrée sur l'arbitrage de l'accès aux matériels. Son originalité réside dans la dissociation de l'activité de l'application de celle des cartes réseaux. Notre modèle exploite l'intervalle de temps introduit entre le dépot des requêtes de communication et la disponibilité des cartes réseaux pour appliquer des optimisations de manière opportuniste. NewMadeleine implémente ce concept et se révèle capable d'exploiter les réseaux les plus performants du moment. Des tests synthétiques et portages d'implémentations caractéristiques de MPI ont permis de valider l'architecture proposéeThe aim of this thesis is to optimize the communications of high performance applications, in the context of clusters computing. Given the massive use of multicore architectures, it is now crucial to handle a large number of concurrent communication flows. We highlighted and analyzed the shortcomings of existing solutions. We therefore designed a new way to schedule communication flows by focusing on the activity of the network cards. Its novelty consists in untying the activity of applications from that of the network cards. Our model takes advantage of the delay that exists between the deposal of the communication requests and the moment when the network cards become idle in order to apply some opportunistic optimizations. NewMadeleine implements this model, thus making possible to exploit last generation high speed networks. The approach of NewMadeleine is not only validated by synthetical tests but also by real applications
19
Moreaud, Stéphanie. "Mouvement de données et placement des tâches pour les communications haute performance sur machines hiérarchiques." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2011. http://tel.archives-ouvertes.fr/tel-00635651.
Full textAbstract:
Les architectures des machines de calcul sont de plus en plus complexes et hiérarchiques, avec des processeurs multicœurs, des bancs mémoire distribués, et de multiples bus d'entrées-sorties. Dans le cadre du calcul haute performance, l'efficacité de l'exécution des applications parallèles dépend du coût de communication entre les tâches participantes qui est impacté par l'organisation des ressources, en particulier par les effets NUMA ou de cache. Les travaux de cette thèse visent à l'étude et à l'optimisation des communications haute performance sur les architectures hiérarchiques modernes. Ils consistent tout d'abord en l'évaluation de l'impact de la topologie matérielle sur les performances des mouvements de données, internes aux calculateurs ou au travers de réseaux rapides, et pour différentes stratégies de transfert, types de matériel et plateformes. Dans une optique d'amélioration et de portabilité des performances, nous proposons ensuite de prendre en compte les affinités entre les communications et le matériel au sein des bibliothèques de communication. Ces recherches s'articulent autour de l'adaptation du placement des tâches en fonction des schémas de transfert et de la topologie des calculateurs, ou au contraire autour de l'adaptation des stratégies de mouvement de données à une répartition définie des tâches. Ce travail, intégré aux principales bibliothèques MPI, permet de réduire de façon significative le coût des communications et d'améliorer ainsi les performances applicatives. Les résultats obtenus témoignent de la nécessité de prendre en compte les caractéristiques matérielles des machines modernes pour en exploiter la quintessence.
20
Nahum, Erich M. "Networking support for high-performance servers." 1997. https://scholarworks.umass.edu/dissertations/AAI9721482.
Full textAbstract:
Networked information systems have seen explosive growth in the last few years, and are transforming society both economically and socially. The information available via the global information infrastructure is growing rapidly, dramatically increasing the performance requirements for large scale information servers. Example services include digital libraries, video-on-demand, World-Wide Web and high-performance file systems. In this dissertation, we investigate performance issues that affect networking-support for high-performance servers. We focus on three research issues: (1) Parallelism Using Packets. The first part of this dissertation identifies performance issues of network protocol processing on shared-memory multiprocessors when packets are used as the unit of concurrency. Our results show good available parallelism for connectionless protocols such as UDP, but limited speedup using TCP within a single connection. However, with multiple connections, parallelism is improved. We demonstrate how locking structure impacts performance, and that a complex protocol such as TCP with large connection state yields better speedup with a single lock than with multiple locks. We show how preserving packet order, exploiting cache affinity and avoiding contention affect performance. (2) Support for Secure Servers. The second part of this dissertation shows how parallelism is an effective means of improving the performance of cryptographic protocols. We demonstrate excellent available parallelism by showing linear speedup with several Internet-based cryptographic protocol stacks, using packet-level parallelism. We also show linear speedup using another approach to parallelism, where connections are the unit of concurrency. (3) Cache Memory Behavior. In the final part of this dissertation we present a performance study of memory reference behavior in network protocol processing. We show that network protocol memory reference behavior varies widely. We find that instruction cache behavior is the primary contributor to protocol performance under most scenarios, and we investigate the impact of architectural features such as associativity and larger cache sizes. We explore these issues in the context of the network subsystem, i.e., the protocol stack, examining throughput, latency, and scalability.
21
Huang, Po-Hsuan, and 黃柏軒. "A High Performance Embedded Networking Vision System." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/23708519908157165472.
Full textAbstract:
碩士國立中央大學
資訊工程學系
101
For the demand of high resolution video streaming networks in the field of industrial inspection and video surveillance, we designed a high-performance embedded networking vision system, which is the integration of image capture control, image processing engine and Gigabit networking module. The Gigabit networking module is even divided into two sub-modules, which are UDP / IP offloading engine and low-density parity-check (LDPC) code. The hardware implementation of the image processing engine includes multiple high-speed morphological image processing units and an upper pipeline controller. In video streaming transmission, a hardware Gigabit UDP / IP offloading engine is applied and an LDPC code is combined in to provide a highly reliable high-speed Internet streaming services. This proposed embedded networked vision system is verified by FPGA. The image processing circuit can run up to 125MHz of the system clock with the input 30 fps Full HD quality video. For the UDP / IP offloading engine and LDPC code can both achieve up to Gbps of throughput. Experiments show that our system can achieve the transfer of 30 fps in uncompressed VGA resolution video streams and provides a good networked embedded vision solution with low-cost and high-performance.
22
Tang, Tang. "High Performance Content Centric Networking on Virtual Infrastructure." Thesis, 2013. http://hdl.handle.net/1807/42962.
Full textAbstract:
Content Centric Networking (CCN) is a novel networking architecture in which communication is resolved based on names, or descriptions of the data transferred instead of addresses of the end-hosts.
While CCN demonstrates many promising potentials, its current implementation suffers from severe performance limitations.
In this thesis we study the performance and analyze the bottleneck of the existing CCN prototype. Based on the analysis, a variety of design alternatives are proposed for realizing high performance content centric networking over virtual infrastructure.
Preliminary implementations for two of the approaches are developed and evaluated on Smart Applications on Virtual Infrastructure (SAVI) testbed. The evaluation results demonstrate that our design is capable of providing scalable content centric routing solution beyond 1Gbps throughput under realistic traffic load.
23
Grant, RYAN. "Improving High Performance Networking Technologies for Data Center Clusters." Thesis, 2012. http://hdl.handle.net/1974/7502.
Full textAbstract:
This dissertation demonstrates new methods for increasing the performance and scalability of high performance networking technologies for use in clustered computing systems, concentrating on Ethernet/High-Speed networking convergence. The motivation behind the improvement of high performance networking technologies and their importance to the viability of modern data centers is discussed first. It then introduces the concepts of high performance networking in a commercial data center context as well as high performance computing (HPC) and describes some of the most important challenges facing such networks in the future. It reviews current relevant literature and discusses problems that are not yet solved.
Through a study of existing high performance networks, the most promising features for future networks are identified. Sockets Direct Protocol (SDP) is shown to have unexpected performance issues for commercial applications, due to inefficiencies in handling large numbers of simultaneous connections. The first SDP over eXtended Reliable Connections implementation is developed to reduce connection management overhead, demonstrating that performance issues are related to protocol overhead at the SDP level. Datagram offloading for IP over InfiniBand (IPoIB) is found to work well.
In the first work of its kind, hybrid high-speed/Ethernet networks are shown to resolve the issues of SDP underperformance and demonstrate the potential for hybrid high-speed networking local area Remote Direct Memory Access (RDMA) technologies and Ethernet wide area networking for data centers.
Given the promising results from these studies, a set of solutions to enhance performance at the local and wide area network level for Ethernet is introduced, providing a scalable, connectionless, socket-compatible, fully RDMA-capable networking technology, datagram-iWARP. A novel method of performing RDMA Write operations (called RDMA Write-Record) and RDMA Read over unreliable datagrams over Ethernet is designed, implemented and tested. It shows its applicability in scientific and commercial application spaces and is applicable to other verbs-based networking interfaces such as InfiniBand.
The newly proposed RDMA methods, both for send/recv and RDMA Write-Record, are supplemented with interfaces for both socket-based applications and Message Passing Interface (MPI) applications. An MPI implementation is adapted to support datagram-iWARP. Both scalability and performance improvements are demonstrated for HPC and commercial applications.Thesis (Ph.D, Electrical & Computer Engineering) -- Queen's University, 2012-09-25 09:43:55.262
24
Chih, Cheng Kuang, and 鄭匡志. "Implementation of High Performance Networking and Modularized Kernel for Embedded Systems." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/55391803102638966436.
Full textAbstract:
碩士南台科技大學
電機工程系
93
Because of the rapid development of network communication, the embedded system is developing a penchant for encompassing network communication. So as to a modernized embedded kernel, the driver of the network has already been one of the indispensable ability. In this thesis, we had implemented one highly modularized kernel which can be dynamically uploaded and downloaded as required. In the kernel, we also development a highly efficient TCP/UDP stack module, that use a zero-copy technique. It enables the system to the best transmission efficiency and is suitable for various network environments. Using current embedded kernels, they are incapable of switching kernel components off-line. In this thesis, we propose a new kernel architecture. Under this architecture, each kernel module can be remotely online upload and download. With the abilities, our system achieves many features such as online upgrade, software reuse, hardware reuse, load balance and so forth which have no possible to be accomplished on traditional systems. Furthermore, as our merit of online configurable, the kernel modules are highly compatible to most target systems. By configuring with an on-line manner, the proposed kernel is adaptable to most target systems. It is convenient to modify system software, and making more competitive to the product market.
25
Sampson, Rizelle Maria. "Formal networking and performance in South Africa's ICT industry." Thesis, 2017. http://hdl.handle.net/10539/23447.
Full textAbstract:
A research report submitted to the Faculty of Commerce, Law and Management, University of the Witwatersrand, in partial fulfilment of the requirements for the degree of Master of Management specialising in Entrepreneurship and New Venture Creation
Johannesburg, 2017Globally, information communication technologies (ICT) have experienced rapid growth since the 1990’s. In South Africa, information communication technology now accounts for a larger percentage of the Gross Domestic Product than other sectors. Thus, ICT is an important driver of entrepreneurship, employment creation and economic development in SA. As such, one of the critical questions is how to ensure the competitiveness and performance of ICT firms. Entrepreneurship studies argue that the performance of entrepreneurial firms is affected by, amongst other things, the firms’ social capital such as formal networks. This study, therefore, examined the impact of formal networks on firm entrepreneurial performance of ICT firms in SA, paying specific attention to weak ties as well as the moderating role of the environment. The study adopted a positivist paradigm which relied on quantitative data, using a descriptive survey method. Applying probability sampling, a sample of 120 firms were surveyed from an industry database, achieving a 14% response rate. This response rate is adequate for the generalisation of the results (Urban & Sefalafala, 2015). In analysing the data, factor analysis to reduce several variables into latent factors was performed. Thereafter, statistical linear regression modelling was performed using the continuous dependent variable – Firm Entrepreneurial Performance indicated by: Growth in Sales and Market Share, and Profitability; and the continuous independent variable of Formal Networking indicated by: Network Tie Strength and Relationship Quality and Nature sub-constructs. The results demonstrate significant correlation between formal networking and firm entrepreneurial performance as well as weak ties. However, the results indicate no evidence for the moderating role of the environment. At a theoretical level, this shows that formal networking and weak ties are beneficial to ICT firms but the environment is a contingent factor. At a practical level, managers and firm owners should consider joining formal networks that promote weak tie relationships in order to access complementary assets and valuable information. Policy makers and other stakeholders should devise policies and programmes that support entrepreneurial ICT firms to engage in formal networking. The limitations of the study include the following: first, the study was cross sectional and limited to ICT firms on an industry database; second, the control variables did not include firm size. Future research should consider a longitudinal study to test the long-term impact of firm entrepreneurial behaviour as well as firm size to inform firm specific research. More studies should test the moderating role of environment.
MT 2017
26
Cheng, Rung-Shiang, and 程榮祥. "A Study on Transmission Control and Loss Recovery Schemes for High Performance TCP/IP Networking." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/87251841088483412996.
Full textAbstract:
博士國立成功大學
電機工程學系碩博士班
96
The Transmission Control Protocol (TCP) provides a reliable host-to-host data transfer function in many network applications and plays a crucial role in controlling congestion throughout the Internet. The performance-related issues arising in TCP-based applications stem primarily from the various interactions between the internal TCP flow control and congestion control schemes and the surrounding communication environment. However, while many attempts have been made to improve the performance of TCP, the algorithms and parameters which are suitable for one environment are generally not transferable to others, and therefore TCP must be specifically adapted to different environments. Accordingly, this thesis discusses the fundamental problems and performance limitations of the TCP transport-layer protocol in various existing and emerging network systems and proposes a number of schemes for enhancing the TCP performance. The proposed schemes are quantified in terms of their achieved effective throughputs and are benchmarked against various existing TCP schemes. The numerical results confirm that the proposed schemes greatly enhance the performance of TCP over a variety of heterogeneous network environments.
27
Chung, Kuo-huang, and 鍾國煌. "The design and implementation of security and networking co-processors for high performance SoC applications." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/84744382782374627716.
Full textAbstract:
碩士國立中山大學
資訊工程學系研究所
91
With the development of Internet, there are more and more applications around us are connected tightly with it. Security of network is important. This thesis will follow OSI 7-layers architecture, which defined by ISO, to propose several hardware improvement approaches of network security. In data-link layer, we improve performance of CRC calculation with parallel CRC calculation, such that a 32-bit data can be finished using CRC calculation in one cycle. In network layer and transport layer, bit-oriented instruction set has good performance for processing packet header. In application, we implement DES and AES algorithm in hardware. We integrate all hardware module with ARM7TDMI coprocessor’s interface. Finally, we download integrated circuit into Xilinx XCV2000E chip to observe its demo to verify it.
28
Liang, Wei-En, and 梁維恩. "A High Performance Media Server and QoS Routing for SVC Streaming based on Software-Defined Networking." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/77885395694563924426.
Full textAbstract:
碩士國立臺灣科技大學
電子工程系
104
Media steaming has become a rapid growing network service and occupied most of traffics in the network. In order to improve the network performance of media server using virtual technologies and to maintain the integrity of media content during streaming, this thesis presents a high-performance media server architecture and the Quality of Service (QoS) routing algorithm for SVC based streaming with Software Defined Networking (SDN) technology. Based on the SDN technology and Kernel-based Virtual Machine (KVM) platform, the network performance of the virtual media server improves by 68% comparing to the traditional KVM virtual server. Meanwhile, with the help of SDN technology, this media server solution has much more flexibility to implement more network service applications. In addition, in order to main the integrity of media data during the transmission, a novel QoS routing algorithm is proposed. This algorithm considers network information including bandwidth, delay, and packet loss and automatically deploys the routes for Scalable Video Coding (SVC) stream, so that the quality of media that user received can be guaranteed. The experimental results show that, compared to traditional shortest path routing and reference work, the proposed routing algorithm reduces the packet loss of streaming and provides higher quality of media content for users.
29
Duggisetty, Padmaja. "Design and Implementation of a High Performance Network Processor with Dynamic Workload Management." 2015. https://scholarworks.umass.edu/masters_theses_2/270.
Full textAbstract:
Internet plays a crucial part in today's world. Be it personal communication, business transactions or social networking, internet is used everywhere and hence the speed of the communication infrastructure plays an important role. As the number of users increase the network usage increases i.e., the network data rates ramped up from a few Mb/s to Gb/s in less than a decade. Hence the network infrastructure needed a major upgrade to be able to support such high data rates. Technological advancements have enabled the communication links like optical fibres to support these high bandwidths, but the processing speed at the nodes remained constant. This created a need for specialised devices for packet processing in order to match the increasing line rates which led to emergence of network processors. Network processors were both programmable and flexible. To support the growing number of internet applications, a single core network processor has transformed into a multi/many core network processor with multiple cores on a single chip rather than just one core. This improved the packet processing speeds and hence the performance of a network node. Multi-core network processors catered to the needs of a high bandwidth networks by exploiting the inherent packet-level parallelism in a network. But these processors still had intrinsic challenges like load balancing. In order to maximise throughput of these multi-core network processors, it is important to distribute the traffic evenly across all the cores. This thesis describes a multi-core network processor with dynamic workload management. A multi-core network processor, which performs multiple applications is designed to act as a test bed for an effective workload management algorithm. An effective workload management algorithm is designed in order to distribute the workload evenly across all the available cores and hence maximise the performance of the network processor. Runtime statistics of all the cores were collected and updated at run time to aid in deciding the application to be performed on a core to to enable even distribution of workload among the cores. Hence, when an overloading of a core is detected, the applications to be performed on the cores are re-assigned. For testing purposes, we built a flexible and a reusable platform on NetFPGA 10G board which uses a FPGA-based approach to prototyping network devices. The performance of the designed workload management algorithm is tested by measuring the throughput of the system for varying workloads.
30
Baloyi, Miringo Samson. "The impact of social networking on high school learners academic performance in rural areas : a case study of Ligege Secondary School." Diss., 2016. http://hdl.handle.net/11602/411.
Full text
31
Vasudevan, Kamlesh T. "Implementation of Data Path Credentials for High-Performance Capabilities-Based Networks." 2009. https://scholarworks.umass.edu/theses/323.
Full textAbstract:
Capabilities-based networks present a fundamental shift in the security design of network architectures. Instead of permitting the transmission of packets from any source to any destination, routers deny forwarding by default. For a successful transmission, packets need to positively identify themselves and their permissions to the router. A major challenge for a high performance implementation of such a network is an efficient design of the credentials that are carried in the packet and the verification procedure on the router. A network protocol that implements data path credentials based on Bloom filters is presented in this thesis. Our prototype implementation shows that there is some connection setup cost associated with this type of secure communication. However, once a connection is established, the throughput performance of a capabilities-based connection is similar to that of conventional TCP.
32
(10223831), Yuankun Fu. "Accelerated In-situ Workflow of Memory-aware Lattice Boltzmann Simulation and Analysis." Thesis, 2021.
Find full textAbstract:
As high performance computing systems are advancing from petascale to exascale, scientific workflows to integrate simulation and visualization/analysis are a key factor to influence scientific campaigns. As one of the campaigns to study fluid behaviors, computational fluid dynamics (CFD) simulations have progressed rapidly in the past several decades, and revolutionized our lives in many fields. Lattice Boltzmann method (LBM) is an evolving CFD approach to significantly reducing the complexity of the conventional CFD methods, and can simulate complex fluid flow phenomena with cheaper computational cost. This research focuses on accelerating the workflow of LBM simulation and data analysis.
I start my research on how to effectively integrate each component of a workflow at extreme scales. Firstly, we design an in-situ workflow benchmark that integrates seven state-of-the-art in-situ workflow systems with three synthetic applications, two real-world CFD applications, and corresponding data analysis. Then detailed performance analysis using visualized tracing shows that even the fastest existing workflow system still has 42% overhead. Then, I develop a novel minimized end-to-end workflow system, Zipper, which combines the fine-grain task parallelism of full asynchrony and pipelining. Meanwhile, I design a novel concurrent data transfer optimization method, which employs a multi-threaded work-stealing algorithm to transfer data using both channels of network and parallel file system. It significantly reduces the data transfer time by up to 32%, especially when the simulation application is stalled. Then investigation on the speedup using OmniPath network tools shows that the network congestion has been alleviated by up to 80%. At last, the scalability of the Zipper system has been verified by a performance model and various largescale workflow experiments on two HPC systems using up to 13,056 cores. Zipper is the fastest workflow system and outperforms the second-fastest by up to 2.2 times.
After minimizing the end-to-end time of the LBM workflow, I began to accelerate the memory-bound LBM algorithms. We first design novel parallel 2D memory-aware LBM algorithms. Then I extend to design 3D memory-aware LBM that combine features of single-copy distribution, single sweep, swap algorithm, prism traversal, and merging multiple temporal time steps. Strong scalability experiments on three HPC systems show that 2D and 3D memory-aware LBM algorithms outperform the existing fastest LBM by up to 4 times and 1.9 times, respectively. The speedup reasons are illustrated by theoretical algorithm analysis. Experimental roofline charts on modern CPU architectures show that memory-aware LBM algorithms can improve the arithmetic intensity (AI) of the fastest existing LBM by up to 4.6 times.