Log in

Relevant bibliographies by topics / Parallel Random Access Machine / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Parallel Random Access Machine.

Dissertations / Theses on the topic 'Parallel Random Access Machine'

Author: Grafiati

Published: 4 June 2021

Last updated: 28 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 26 dissertations / theses for your research on the topic 'Parallel Random Access Machine.'

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

Liang, Weifa, and wliang@cs anu edu au. "Designing Efficient Parallel Algorithms for Graph Problems." The Australian National University. Department of Computer Science, 1997. http://thesis.anu.edu.au./public/adt-ANU20010829.114536.

Full text

Abstract:

Graph algorithms are concerned with the algorithmic aspects of solving graph problems. The problems are motivated from and have application to diverse areas of computer science, engineering and other disciplines. Problems arising from these areas of application are good candidates for parallelization since they often have both intense computational needs and stringent response time requirements. Motivated by these concerns, this thesis investigates parallel algorithms for these kinds of graph problems that have at least one of the following properties: the problems involve some type of dynamic

APA, Harvard, Vancouver, ISO, and other styles

2

Sayles, Andre Harding. "Design of integrated CMOS circuits for parallel detection and storage of optical data." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/13740.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Calderoni, Lisa. "Prove Zero-Knowledge e Random Access Machines: un Risultato d'Invarianza." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2011. http://amslaurea.unibo.it/1937/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Chen, Xiaowei. "High Performance Static Random Access Memory Design for Emerging Applications." Diss., North Dakota State University, 2018. https://hdl.handle.net/10365/31743.

Full text

Abstract:

Memory wall is becoming a more and more serious bottleneck of the processing speed of microprocessors. The mismatch between CPUs and memories has been increasing since three decades ago. SRAM was introduced as the bridge between the main memory and the CPU. SRAM is designed to be on the same die with CPU and stores temporary data and instructions that are to be processed by the CPU. Thus, the performance of SRAMs has a direct impact on the performance of CPUs. With the application of mass amount data to be processed nowadays, there is a great need for high-performance CPUs. Three dimensional

APA, Harvard, Vancouver, ISO, and other styles

5

Mawlawi, Baher. "Random access for dense networks : Design and Analysis of Multiband CSMA/CA." Thesis, Lyon, INSA, 2015. http://www.theses.fr/2015ISAL0112/document.

Full text

Abstract:

Les protocoles de communications à accès aléatoires sont des candidats prometteurs pour les futurs systèmes de communications sans fil dédiés aux applications machine à machine (M2M). Ces méthodes d’accès sont généralement basées sur des techniques d'accès aléatoires mettant en œuvre des concepts simples de sondage de canal et de report de la transmission pour réduire les collisions, tout en évitant l'utilisation d'ordonnanceurs complexes. Parmi les différents protocoles, Carrier sense multiple access/collision avoidance with a Request-To-Send/Clear-To-Send (CSMA/CA-RTS/CTS) est un protocole q

APA, Harvard, Vancouver, ISO, and other styles

6

Vilgelm, Mikhail [Verfasser], Wolfgang [Akademischer Betreuer] Kellerer, Wolfgang [Gutachter] Kellerer, and Petar [Gutachter] Popovski. "Random Access Protocols for Massive and Reliable Machine-to-Machine Communication / Mikhail Vilgelm ; Gutachter: Wolfgang Kellerer, Petar Popovski ; Betreuer: Wolfgang Kellerer." München : Universitätsbibliothek der TU München, 2019. http://d-nb.info/1205069283/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Tello, Oquendo Luis Patricio. "Design and Performance Analysis of Access Control Mechanisms for Massive Machine-to-Machine Communications in Wireless Cellular Networks." Doctoral thesis, Universitat Politècnica de València, 2018. http://hdl.handle.net/10251/107946.

Full text

Abstract:

En la actualidad, la Internet de las Cosas (Internet of Things, IoT) es una tecnología esencial para la próxima generación de sistemas inalámbricos. La conectividad es la base de IoT, y el tipo de acceso requerido dependerá de la naturaleza de la aplicación. Uno de los principales facilitadores del entorno IoT es la comunicación machine-to-machine (M2M) y, en particular, su enorme potencial para ofrecer conectividad ubicua entre dispositivos inteligentes. Las redes celulares son la elección natural para las aplicaciones emergentes de IoT y M2M. Un desafío importante en las redes celulares es c

APA, Harvard, Vancouver, ISO, and other styles

8

Fengler, Alexander [Verfasser], Giuseppe [Akademischer Betreuer] Caire, Peter [Akademischer Betreuer] Jung, Giuseppe [Gutachter] Caire, Gianluigi [Gutachter] Liva, and Krishna [Gutachter] Narayanan. "Sparse recovery based grant-free random access for massive machine-type communication / Alexander Fengler ; Gutachter: Giuseppe Caire, Gianluigi Liva, Krishna Narayanan ; Giuseppe Caire, Peter Jung." Berlin : Technische Universität Berlin, 2021. http://d-nb.info/1230468463/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Kalalas, Charalampos. "Cellular networks for smart grid communication." Doctoral thesis, Universitat Politècnica de Catalunya, 2018. http://hdl.handle.net/10803/620760.

Full text

Abstract:

The next-generation electric power system, known as smart grid, relies on a robust and reliable underlying communication infrastructure to improve the efficiency of electricity distribution. Cellular networks, e.g., LTE/LTE-A systems, appear as a promising technology to facilitate the smart grid evolution. Their inherent performance characteristics and well-established ecosystem could potentially unlock unprecedented use cases, enabling real-time and autonomous distribution grid operations. However, cellular technology was not originally intended for smart grid communication, associated with h

APA, Harvard, Vancouver, ISO, and other styles

10

Leyva, Mayorga Israel. "On reliable and energy efficient massive wireless communications: the road to 5G." Doctoral thesis, Universitat Politècnica de València, 2019. http://hdl.handle.net/10251/115484.

Full text

Abstract:

La quinta generación de redes móviles (5G) se encuentra a la vuelta de la esquina. Se espera provea de beneficios extraordinarios a la población y que resuelva la mayoría de los problemas de las redes 4G actuales. El éxito de 5G, cuya primera fase de estandarización ha sido completada, depende de tres pilares: comunicaciones tipo-máquina masivas, banda ancha móvil mejorada y comunicaciones ultra fiables y de baja latencia (mMTC, eMBB y URLLC, respectivamente). En esta tesis nos enfocamos en el primer pilar de 5G, mMTC, pero también proveemos una solución para lograr eMBB en escenarios de distr

APA, Harvard, Vancouver, ISO, and other styles

11

"Lower bounds on the time to compute a simple boolean function on a parallel random access machine." Laboratory for Information and Decision Systems, Massachusetts Institute of Technology], 1986. http://hdl.handle.net/1721.1/2964.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Liang, Weifa. "Designing Efficient Parallel Algorithms for Graph Problems." Phd thesis, 1997. http://hdl.handle.net/1885/47660.

Full text

Abstract:

Graph algorithms are concerned with the algorithmic aspects of solving graph problems. The problems are motivated from and have application to diverse areas of computer science, engineering and other disciplines. Problems arising from these areas of application are good candidates for parallelization since they often have both intense computational needs and stringent response time requirements. Motivated by these concerns, this thesis investigates parallel algorithms for these kinds of graph problems that have at least one of the following properties: the problems involve some type of dynamic

APA, Harvard, Vancouver, ISO, and other styles

13

Chen, Chih-Yu, and 陳志瑜. "Secure Reusable Garbled Random Access Machine." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/h47xfu.

Full text

Abstract:

碩士<br>國立中山大學<br>資訊工程學系研究所<br>103<br>In 1980s, Yao proposed a secure computation which can allow two parties, one of which has a function f(⋅) and the other one has data x, to compute f(x) without revealing anything about f and x. Garbled circuits got numerous applications. But every time we want to garble a program, we need to convert it into a circuit first. In 2013, Lu and Ostrovsky proposed the garbled random-access machines, which can garble a RAM program directly. They constructed garbled RAM based on the pseudo-random functions and the Beaver-Micali-Rogaway paradigm in the semi-honest mo

APA, Harvard, Vancouver, ISO, and other styles

14

Che-Wei, Hsu, and 許哲維. "Random Backoff Assisted Random Access Collision Reduction for Massive Machine-Type Cellular Communications." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/6wkek5.

Full text

Abstract:

碩士<br>國立中央大學<br>資訊工程學系<br>106<br>With the popularity of smart mobile devices, surfing the Internet anytime, anywhere has become a kind of necessity for modern life. How to combine the mobile communication technologies with other technologies to support more services in mobile networks is one of major issues. In current LTE-A network, the base station (eNB) only schedules the channel resource for the devices (UE) which has established the radio resource control (RRC) connections. For the UE staying in IDLE mode, it has to perform the random access procedure (RAP) in order to establish RRC conne

APA, Harvard, Vancouver, ISO, and other styles

15

Huang, Yi-Shin, and 黃誼欣. "Random Access Procedure for Machine Type Communication in Mobile Networks." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/42ubda.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>電子工程系<br>105<br>Machine-type communication (MTC) can generate numerous connection requests and bring explosive load within small time interval. A massive amount of simultaneous random access attempts results in a high collision probability and intolerable access delay because more devices contend in shared random access channels (RACH) with limited capacity. Thus, this thesis addressed a novel mechanism, denoted as two-phase random access (TPRA) procedure, for MTC in mobile networks to relieve the load of RACH. The proposed TPRA reduces probability of collision among the MTC

APA, Harvard, Vancouver, ISO, and other styles

16

Wang, Hua-Li, and 王華立. "An Energy Efficient Random Access Control Scheme in LTE-A Systems with Machine-to-Machine Communication." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/04559152589682992686.

Full text

Abstract:

碩士<br>國立交通大學<br>電信工程研究所<br>101<br>Machine-to-machine (M2M) communication is a type of communication. It makes the automatic information exchange between a machine and other machine or a machine and a machine type communication (MTC) server by integrating various wireless communication techniques to satisfy requirements of many applications. Because M2M communication can provide various automatic applications and open a new market, M2M communication is received public attention. But M2M communication needs to deploy a large number of machines everywhere, and bring the current 4G wireless commun

APA, Harvard, Vancouver, ISO, and other styles

17

Yang, Ping-Hsun, and 楊秉勳. "Analysis of Distributed Queueing-based Random Access for Machine-type Communications in LTE." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/2apjyg.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>電子工程系<br>105<br>Distributed queueing (DQ)-based random access (RA) is an access protocol which can efficiently deal with the massive collision to support machine type communication in LTE cellular network. In DQ-based RA, there is a trade-off between the reduced collision and the increased access delay. To analyze the worst delay condition, it is necessary for the cellular network to guarantee the access delay bound. Thus, the maximum access delay is one important performance index in DQ-based RA. This thesis develops an analytical model to estimate the maximum access delay f

APA, Harvard, Vancouver, ISO, and other styles

18

Harwahyu, Ruki, and Ruki Harwahyu. "Optimization of Random Access Procedure for Machine-type Communications in LTE-based Systems." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/zmts5d.

Full text

Abstract:

博士<br>國立臺灣科技大學<br>電子工程系<br>106<br>One scenario in internet of things (IoT) is called massive machine-type communication (mMTC). mMTC is commonly characterized with massive number of devices with small and infrequent data transmission. mMTC can be served with cellular technology such as LTE-Advanced (LTE-A) and Narrowband IoT (NB-IoT). In both of them, each device wanting to send their data needs to complete random access (RA) procedure. The RA procedure in LTE-A and NB-IoT is based on multi-channel slotted ALOHA system, which has very low throughput under high load. This is serious bottleneck

APA, Harvard, Vancouver, ISO, and other styles

19

CHENG, HAO-PING, and 鄭皓平. "A novel random access technique for massive machine-type communications with heterogeneous users." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/3cfgyt.

Full text

Abstract:

碩士<br>國立臺北大學<br>通訊工程研究所<br>107<br>As 5G technology developing further, the requirements of different applications become clear. There are three types of use cases. Enhanced mobile broadband(eMBB),ultra-reliable and low latency communications(URLLC) and massive machine-type communications(mMTC). First is eMBB, which is used for wider bandwidth applications like mobile broadband service. And URLLC applications require a more reliable and low latency connection. Like factory automation and remote surgery. The last one, mMTC, is the focus of this thesis. mMTC is used in a scenario that has a large

APA, Harvard, Vancouver, ISO, and other styles

20

Lin, Yun Ting, and 林昀廷. "A Delayed Random Access Speed-Up Scheme for Group Paging in Machine-Type Communications." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/98412895124256877291.

Full text

Abstract:

碩士<br>長庚大學<br>資訊工程學系<br>103<br>Machine-type communication (MTC) has raised significant interests in recent years. However, due to the massive number of machine type communication devices that are anticipated to communicate using cellular networks, there is a major problem on efficient accommodation of the heavy Random Access (RA) loads from the MTC devices. Use of small cells has been specified to provide network denazification by 3GPP. By searching several references [3-9] about controlling devices under an eNB efficiently, we acquire that group paging is an appropriate solution for us to sol

APA, Harvard, Vancouver, ISO, and other styles

21

Shih, Cheng-Ting, and 施政廷. "Improve Physical Random Access Channel Congestion Problem for Machine-Type Communication in LTE-A." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/dd6pan.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>電機工程系<br>106<br>With the rapid development of wireless communication technology, the concept of IoT has been emerge in people's lives and makes us more convenient and intelligent application services. In the Internet of Things, machine-type communication (MTC) technology has become one of the key technological development. It has several features such as low power consumption and cost, low data volume, low or no mobility, and high coverage. Automated decision-making and transmission between machine and machine eliminates the need for human-controlled communication technology.

APA, Harvard, Vancouver, ISO, and other styles

22

Sridhar, Jaishree Sarojini Philip, and 潔絲芮. "A Novel Random-Access Scheme Based on Cuckoo Filter for Massive Machine Type Communication." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/jqrkw5.

Full text

Abstract:

碩士<br>國立宜蘭大學<br>電子工程學系碩士班<br>106<br>The ever-increasing data rate with limited resources has led to the introduction of new schemes to improve the user experience. Traditionally a low number of connections with high data requirements are achieved over a network dealing with the limited amount of connections established between the device and the Base Station (BS) before the device can transmit its data packet. But emerging technologies such as Machine-to-Machine (M2M) communication features present a significant challenge to cellular networks, whose radio access requirement is high. LTE-A invo

APA, Harvard, Vancouver, ISO, and other styles

23

WEI, CHIA-HUNG, and 魏嘉宏. "Transient-performance Analysis of Random Access Channels in LTE Cellular Networks Supporting Machine-type Communications." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/36731741815403448520.

Full text

Abstract:

博士<br>國立臺灣科技大學<br>電子工程系<br>101<br>Multichannel slotted ALOHA is a widely used protocol for random-access channels (RACH) in cellular networks. Existing studies of multichannel slotted ALOHA were developed for investigating the performance of a light-load system with steady-state analysis based on the assumptions of constant-rate Poisson arrivals for voice or low data rate service . Machine-type communication (MTC) services are expected to generate huge and bursty access attempts in a short period of time and thus, congest the RACH which do not reserve enough resources. The short-term congestio

APA, Harvard, Vancouver, ISO, and other styles

24

Khan, Reduan H. "Machine-to-machine communications over an IEEE 802.16-based WiMAX network in the smart grid." Thesis, 2014. http://hdl.handle.net/1959.13/1055891.

Full text

Abstract:

Research Doctorate - Doctor of Philosophy (PhD)<br>A robust communication infrastructure is the touchstone of a Smart Grid that differentiates it from the conventional electrical grid by transforming it into an intelligent and adaptive energy delivery network. To cope with the rising penetration of renewable energy sources and expected widespread adoption of electric vehicles, the future Smart Grid needs to implement efficient monitoring and control technologies to improve its operational efficiency. However, legacy communication infrastructures in the existing grid are quite insufficient, if

APA, Harvard, Vancouver, ISO, and other styles

25

Li, Hsuan-Chih, та 黎軒志. "Series and Parallel Measurement of Resistive Random Access Memory with Floating Terminal Effect and 1/f Noise Analysis of Poly-Silicon Thin Film Transistor and α-IGZO Thin Film Transistor". Thesis, 2011. http://ndltd.ncl.edu.tw/handle/07971496856384107093.

Full text

Abstract:

碩士<br>國立臺灣大學<br>電子工程學研究所<br>99<br>In this thesis, the first part is the model and physical mechanism of Resistive random access memory (RRAM). RRAM is one of the many types nonvolatile memory, which is the most promising candidate to replace traditional flash memory. External voltage is added on RRAM to switch the device between low resistance state (LRS) and high resistance state (HRS), and recorded to Logic 0 or 1. RRAM has advantages of low power consumption and low operation voltage (write voltage &lt;3V, read voltage ~0.1V), a simple structure (a transition metal oxide layer between t

APA, Harvard, Vancouver, ISO, and other styles

26

Haas, František. "Paralelní zpracování velkých objemů astronomických dat." Master's thesis, 2016. http://www.nusl.cz/ntk/nusl-352743.

Full text

Abstract:

This master thesis focuses on the Random Forests algorithm analysis and implementation. The Random Forests is a machine learning algorithm targeting data classification. The goal of the thesis is an implementation of the Random Forests algorithm using techniques and technologies of parallel programming for CPU and GPGPU and also a reference serial implementation for CPU. A comparison and evaluation of functional and performance attributes of these implementations will be performed. For the comparison of these implementations various data sets will be used but an emphasis will be given to real

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!