Relevant bibliographies by topics / Parallel Random Access Machine

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Parallel Random Access Machine"

1

Tiskin, Alexandre. "The bulk-synchronous parallel random access machine." Theoretical Computer Science 196, no. 1-2 (1998): 109–30. http://dx.doi.org/10.1016/s0304-3975(97)00197-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

TRAHAN, JERRY L., and HOSANGADI BHANUKUMAR. "PARALLEL RANDOM ACCESS MACHINES WITHOUT BOOLEAN OPERATIONS." Parallel Processing Letters 04, no. 01n02 (1994): 117–24. http://dx.doi.org/10.1142/s0129626494000132.

Full text
Abstract:
The class of problems solved within given time and processor bounds on a Parallel Random Access Machine (PRAM) varies with the instruction set. Previous research has classified the contributions of various instructions, such as multiplication, shifts, and string manipulation operations, to the PRAM. This paper examines the significant contribution of Boolean operations, which play essential roles in many PRAM algorithms and in simulations by the PRAM of other models of computation.
APA, Harvard, Vancouver, ISO, and other styles
3

COSNARD, MICHEL, and AFONSO FERREIRA. "ON THE REAL POWER OF LOOSELY COUPLED PARALLEL ARCHITECTURES." Parallel Processing Letters 01, no. 02 (1991): 103–11. http://dx.doi.org/10.1142/s0129626491000057.

Full text
Abstract:
We propose new models of SIMD distributed memory parallel computers. We define concurrent read/write access also for machines other than PRAM. Our goal is to unify the description of abstract models of parallel machines with the aim of building a complexity theory where all models can be soundly compared. As an example, we introduce the Hypercube Random Access Machine with concurrent read/write capabilities, and show that it can solve some problems faster than the PRAM.
APA, Harvard, Vancouver, ISO, and other styles
4

Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. "Transforming comparison model lower bounds to the parallel-random-access-machine." Information Processing Letters 62, no. 2 (1997): 103–10. http://dx.doi.org/10.1016/s0020-0190(97)00032-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bellantoni, Stephen J. "Parallel random access machines with bounded memory wordsize." Information and Computation 91, no. 2 (1991): 259–73. http://dx.doi.org/10.1016/0890-5401(91)90069-e.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Behnezhad, Soheil, Laxman Dhulipala, Hossein Esfandiari, Jakub Łącki, Vahab Mirrokni, and Warren Schudy. "Massively Parallel Computation via Remote Memory Access." ACM Transactions on Parallel Computing 8, no. 3 (2021): 1–25. http://dx.doi.org/10.1145/3470631.

Full text
Abstract:
We introduce the Adaptive Massively Parallel Computation (AMPC) model, which is an extension of the Massively Parallel Computation (MPC) model. At a high level, the AMPC model strengthens the MPC model by storing all messages sent within a round in a distributed data store. In the following round, all machines are provided with random read access to the data store, subject to the same constraints on the total amount of communication as in the MPC model. Our model is inspired by the previous empirical studies of distributed graph algorithms [8, 30] using MapReduce and a distributed hash table s
APA, Harvard, Vancouver, ISO, and other styles
7

KhurramPasha, Madiha, Maryam Feroze, and Khurram Ahmad Pasha. "A Parallel Random Access Machine (PRAM) Model for English Language Recognizer (PRAM-ELR)." International Journal of Computer Applications 118, no. 6 (2015): 12–18. http://dx.doi.org/10.5120/20749-3139.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Leiserson, Charles E., and Bruce M. Maggs. "Communication-efficient parallel algorithms for distributed random-access machines." Algorithmica 3, no. 1-4 (1988): 53–77. http://dx.doi.org/10.1007/bf01762110.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Trahan, J. L., V. Ramachandran, and M. C. Loui. "Parallel Random Access Machines with both Multiplication and Shifts." Information and Computation 110, no. 1 (1994): 96–118. http://dx.doi.org/10.1006/inco.1994.1025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Trahan, Jerry L., Michael C. Loui, and Vijaya Ramachandran. "Multiplication, division, and shift instructions in parallel random access machines." Theoretical Computer Science 100, no. 1 (1992): 1–44. http://dx.doi.org/10.1016/0304-3975(92)90362-j.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

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

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
More sources

Books on the topic "Parallel Random Access Machine"

1

United States. National Aeronautics and Space Administration. Scientific and Technical Information Division., ed. Parallel optical random access memory (PORAM). National Aeronautics and Space Administration, Office of Management, Scientific and Technical Information Division, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Parallel Random Access Machine"

1

Tiskin, Alexandre. "The bulk-synchronous parallel random access machine." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0024720.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Leasure, Bruce, David J. Kuck, Sergei Gorlatch, et al. "Parallel Random Access Machines (PRAM)." In Encyclopedia of Parallel Computing. Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_2093.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Leasure, Bruce, David J. Kuck, Sergei Gorlatch, et al. "PRAM (Parallel Random Access Machines)." In Encyclopedia of Parallel Computing. Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_23.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Maggs, Bruce. "Beyond Parallel Random-Access Machines." In Opportunities and Constraints of Parallel Computing. Springer US, 1989. http://dx.doi.org/10.1007/978-1-4613-9668-0_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lange, Klaus-Jörn, and Rolf Niedermeier. "Data-independences of parallel random access machines." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57529-4_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fich, Faith E., Russell Impagliazzo, Bruce Kapron, Valerie King, and Miroslaw Kutylowski. "Limits on the power of parallel random access machines with weak forms of write conflict resolution." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-56503-5_39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Martens, Jan, Jan Friso Groote, Lars van den Haak, Pieter Hijma, and Anton Wijs. "A Linear Parallel Algorithm to Compute Bisimulation and Relational Coarsest Partitions." In Formal Aspects of Component Software. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-90636-8_7.

Full text
Abstract:
AbstractThe most efficient way to calculate strong bisimilarity is by finding the relational coarsest partition of a transition system. We provide the first linear-time algorithm to calculate strong bisimulation using parallel random access machines (PRAMs). More precisely, with n states, m transitions and $$| Act |\le m$$ | A c t | ≤ m action labels, we provide an algorithm for $$\max (n,m)$$ max ( n , m ) processors that calculates strong bisimulation in time $$\mathcal {O}(n+| Act |)$$ O ( n + | A c t | ) and space $$\mathcal {O}(n+m)$$ O ( n + m ) . The best-known PRAM algorithm has time complexity $$\mathcal {O}(n\log n)$$ O ( n log n ) on a smaller number of processors making it less suitable for massive parallel devices such as GPUs. An implementation on a GPU shows that the linear time-bound is achievable on contemporary hardware.
APA, Harvard, Vancouver, ISO, and other styles
8

Dolev, Shlomi, and Yin Li. "Secret Shared Random Access Machine." In Algorithmic Aspects of Cloud Computing. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-29919-8_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chlebus, Bogdan S., Artur Czumaj, Leszek Gasieniec, Mirosław Kowaluk, and Wojciech Plandowski. "Parallel Alternating-Direction Access Machine." In Mathematical Foundations of Computer Science 1996. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61550-4_154.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Neukirchen, Helmut. "Taming the Raven – Testing the Random Access, Visualization and Exploration Network RAVEN." In Applied Parallel and Scientific Computing. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28145-7_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Parallel Random Access Machine"

1

Penha, Dulcinéia O. da, Henrique C. de Freitas, and Carlos A. P. S. Martins. "Modelo de Memória Reconfigurável para Sistemas Paralelos." In Workshop em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2004. http://dx.doi.org/10.5753/wscad.2004.19001.

Full text
Abstract:
Arquiteturas paralelas atuais possuem modelo de memória único e estático. Entretanto, as cargas de trabalho de um sistema computacional possuem características distintas e às vezes até divergentes. Conseqüentemente, a escolha de um modelo de memória ideal é dificil e envolve custo, desempenho, disponibilidade, entre outros fatores. Neste trabalho, propomos um modelo de memória reconfigurável para sistemas computacionais paralelos chamado RMA (Reconfigurable Memory Access). Este modelo de memória visa flexibilidade e adaptabilidade na utilização de sistemas de memória de computadores paralelos.
APA, Harvard, Vancouver, ISO, and other styles
2

Wang, Sen-Hung, Hsuan-Jung Su, Hung-Yun Hsieh, Shu-ping Yeh, and Minnie Ho. "Random access design for clustered wireless machine to machine networks." In 2013 First International Black Sea Conference on Communications and Networking (BlackSeaCom). IEEE, 2013. http://dx.doi.org/10.1109/blackseacom.2013.6623391.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pratas, Nuno K., Henning Thomsen, Cedomir Stefanovic, and Petar Popovski. "Code-expanded random access for machine-type communications." In 2012 IEEE Globecom Workshops (GC Wkshps). IEEE, 2012. http://dx.doi.org/10.1109/glocomw.2012.6477838.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

LIEN, SHAO-YU, and Yueh Jir Wang. "To Random Access Or Schedule? Optimum 3GPP Licensed-Assisted Access for Machine-to-Machine Communications." In 11th EAI International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness. IEEE, 2015. http://dx.doi.org/10.4108/eai.19-8-2015.2260365.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chia-Wei Chang, Jyh-Cheng Chen, Chien Chen, and Rong-Hong Jan. "Scattering random-access intensity in LTE Machine-to-Machine (M2M) communications." In 2013 IEEE Global Communications Conference (GLOBECOM 2013). IEEE, 2013. http://dx.doi.org/10.1109/glocomw.2013.6855698.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Tran Duc Linh, Tony de Souza-Daw, Thang Manh Hoang, and Nguyen Tien Dzung. "Parallel Random Access Memory in a shared memory architecture." In 2014 IEEE Fifth International Conference on Communications and Electronics (ICCE). IEEE, 2014. http://dx.doi.org/10.1109/cce.2014.6916731.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

McAulay, Alastair D., Junqing Wang, and Xin Xu. "Optical word parallel interconnections between optical random access memories." In Aerospace Sensing, edited by Dennis R. Pape. SPIE, 1992. http://dx.doi.org/10.1117/12.139911.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liao, Zhen, Xiaodong Ji, Xiangqian Sun, and Huilin Zhao. "REsearch of Random Access Procedure on Machine Type Communication." In 2018 International Conference on Network Infrastructure and Digital Content (IC-NIDC). IEEE, 2018. http://dx.doi.org/10.1109/icnidc.2018.8525685.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kim, Taehoon, Kab Seok Ko, and Dan Keun Sung. "Prioritized random access for machine-to-machine communications in OFDMA based systems." In 2015 IEEE International Conference on Signal Processing for Communications (ICC). IEEE, 2015. http://dx.doi.org/10.1109/icc.2015.7248778.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

MOHANTY, AMIYA RANJAN, and RANJAN SASTI CHARAN PAL. "A CYBER-PHYSICAL SYSTEM BASED REAL-TIME FAULT DIAGNOSIS OF INDUCTION MOTORS." In Structural Health Monitoring 2021. Destech Publications, Inc., 2022. http://dx.doi.org/10.12783/shm2021/36275.

Full text
Abstract:
Induction motors are one of the major electrical prime movers in industrial sectors. Since these motors are operated continuously, they are subjected to wear and tear which lead to faults at a later stage in its life. These faults which arise can be classified into 5 major categories i.e., broken rotor bars, stator winding faults, air-gap eccentricity, bearing faults, and torque fluctuations. A failure in induction motors leads to machine downtime, increased maintenance costs, and puts the lives of the plant personnel at risk, thus leading to undesirable consequences. Hence, uninterrupted oper
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Parallel Random Access Machine"

1

Pawagi, Shaunak, and I. V. Ramakrishnan. Updating Properties of Directed Acyclic Graphs on a Parallel Random Access Machine. Defense Technical Information Center, 1985. http://dx.doi.org/10.21236/ada162954.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Parallel Random Access Machine' for particular source types:
Journal articles Dissertations / Theses
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!

To the bibliography