Academic literature on the topic 'Concurrent/parallel systems and technologies'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Concurrent/parallel systems and technologies.'
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 "Concurrent/parallel systems and technologies"
Shiau, Liejune. "Exploring Quasi-Concurrency in Introductory Computer Science." Journal of Educational Computing Research 15, no. 1 (July 1996): 53–66. http://dx.doi.org/10.2190/7ldf-va2r-vk66-qq8d.
Full textChaudhary, Renu, and Gagangeet Singh. "A NOVEL TECHNIQUE IN NoSQL DATA EXTRACTION." International Journal of Research -GRANTHAALAYAH 1, no. 1 (August 31, 2014): 51–58. http://dx.doi.org/10.29121/granthaalayah.v1.i1.2014.3086.
Full textKaur Dhaliwal, Japman, Mohd Naseem, Aadil Ahamad Lawaye, and Ehtesham Husain Abbasi. "Fibonacci Series based Virtual Machine Selection for Load Balancing in Cloud Computing." International Journal of Engineering & Technology 7, no. 3.12 (July 20, 2018): 1071. http://dx.doi.org/10.14419/ijet.v7i3.12.17634.
Full textThompson, P. "Concurrent Interconnect for Parallel Systems." Computer Journal 36, no. 8 (August 1, 1993): 778–84. http://dx.doi.org/10.1093/comjnl/36.8.778.
Full textMassei, Giovanna, and Dave Cowan. "Fertility control to mitigate human–wildlife conflicts: a review." Wildlife Research 41, no. 1 (2014): 1. http://dx.doi.org/10.1071/wr13141.
Full textStotts, P. David, and William Pugh. "Parallel finite automata for modeling concurrent software systems." Journal of Systems and Software 27, no. 1 (October 1994): 27–43. http://dx.doi.org/10.1016/0164-1212(94)90112-0.
Full textTaylor, Stephen, Shmuel Safra, and Ehud Shapiro. "A parallel implementation of Flat Concurrent Prolog." International Journal of Parallel Programming 15, no. 3 (June 1986): 245–75. http://dx.doi.org/10.1007/bf01414556.
Full textMalyshkin, Victor. "Parallel computing technologies 2020." Journal of Supercomputing 78, no. 4 (October 4, 2021): 6056–59. http://dx.doi.org/10.1007/s11227-021-04014-w.
Full textMalyshkin, Victor. "Parallel computing technologies 2020." Journal of Supercomputing 78, no. 4 (October 4, 2021): 6056–59. http://dx.doi.org/10.1007/s11227-021-04014-w.
Full textMalyshkin, Victor E. "Parallel computing technologies 2018." Journal of Supercomputing 75, no. 12 (November 20, 2019): 7747–49. http://dx.doi.org/10.1007/s11227-019-03014-1.
Full textDissertations / Theses on the topic "Concurrent/parallel systems and technologies"
Sobel, Ann E. Kelley. "Modular verification of concurrent systems /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487267546983528.
Full textChai, Kok-Soon. "A concurrent methodology for parallel robot-based cooperative systems." Thesis, University of Warwick, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.400097.
Full textWabenhorst, Axel. "On fairness in terminating and reactive systems." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337430.
Full textVigder, Mark (Mark Ronald) Carleton University Dissertation Engineering Electrical. "Applying formal techniques to the design of concurrent systems." Ottawa, 1992.
Find full textZilio, Daniel C. "Physical database design decision algorithms and concurrent reorganization for parallel database systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ35386.pdf.
Full textMenon, Sathis N. "Asynchronous events : tools for distributed programming on concurrent object-based systems." Diss., Georgia Institute of Technology, 1994. http://hdl.handle.net/1853/9147.
Full textPINTO, Gustavo Henrique Lima. "A refactoring approach to improve energy consumption of parallel software systems." Universidade Federal de Pernambuco, 2015. https://repositorio.ufpe.br/handle/123456789/16346.
Full textMade available in DSpace on 2016-04-06T13:27:55Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) versao_biblioteca.pdf: 3051240 bytes, checksum: ac1a91e08d64c78a372cb0e151bcb7c7 (MD5) Previous issue date: 2015-02-24
CAPEs
Empowering application programmers to make energy-aware decisions is a critical dimension in improving energy efficiency of computer systems. Despite the growing interest in designing software development processes, frameworks, and programming models to facilitate application-level energy management, little is known on how to design application-level energy-efficient solutions for concurrent software running on parallel architectures. This is unfortunate for at least two reasons: (1) thanks to the proliferation of multicore CPUs, concurrent programming is a standard practice in modern software engineering; (2) a CPU with more cores (say 32) often consumes more power than one with fewer cores (say 1 or 2). However, application developers still do not understand how their code modifications impact energy consumption in a parallel system. Analyzing STACKOVERFLOW showed evidence that this is a real problem; Even though the interest in energy consumption issues is increasing over the years, developers still hold misconceptions and assumptions that are not always true. This lack of knowledge is primarily due to a lack of appropriate tools to measure/identify/refactor energy consumption hotspots. This thesis begins to bridge the chasm of the first problem — the lack of knowledge — by presenting an extensive experimental space exploration over two concurrent programming building blocks: (1) thread-safe collections and (2) thread management constructs. Through a list of findings that are not always obvious, we illuminate the relationship between the choices and settings of design decisions and energy consumption of parallel systems. This thesis then starts to bridge the gap of the second problem — the lack of tools. Lessons learned in our previous studies showed that ForkJoin tasks often operate on an indexable data structure, with subtasks operating only on part of this data structure. One naïve solution is to copy part of the data structure and use it in the next computation. In a recursive framework such as ForkJoin, given an array-based representation, each recursive call will create n new arrays, where n is the width of forking. To address this, we derive a refactoring that, instead of copy part of the data structure, it shares it, allowing subtasks to operate on contiguous partitions of the data structure. We manually applied this refactoring into 15 open source projects. Our refactoring succeed in saving energy for each one of them (12% average saving). We sent the refactored versions to the project owner and, during a timeframe of 40 days, 7 out of 9 projects that replied to our patches have already accepted and merged them. Discussions during the merge process revealed that developers were not aware of this optimization. We then implemented this refactoring as an Eclipse plug-in so that other developers can (1) detect uses of copy where it would be beneficial to use sharing and (2) refactor the code in an automated way.
Fornecer meios para que desenvolvedores de software tomem decisões energeticamente eficientes é uma dimensão crítica para se melhorar o consumo de energia de sistemas computacionais. Apesar do crescente interesse em processos de desenvolvimento de software, arcabouços, e modelos de programação de forma a facilitar o gerenciamento de energia no nível da aplicação, pouco se sabe sobre como arquitetar sistemas concorrentes energéticamente eficientes que rodem em arquiteturas paralelas. Isso é inoportuno por pelo menos duas razões: (1) graças a proliferação de CPUs multicore, programação concorrente se tornou uma prática padrão na engenharia de software moderna; (2) uma CPU com várias unidades de processamento (por exemplo, 32) geralmente dissipa mais potência do que uma com um número menor (por exemplo, 1 ou 2). No entanto, desenvolvedores ainda não entendem como suas modificações de código impactam no consumo de energia de uma aplicação paralela. Uma análise do StackOverflow mostrou evidências que esse é um problema real; mesmo embora exista um crescente interesse em questões relacionadas ao consumo de energia, desenvolvedores ainda cometem equívocos e mantêm suposições que não são sempre verdadeiras. Essa falta de conhecimento é primariamente devido a falta de ferramentas apropriadas para medir/identificar/refatorar hotspots de consumo de energia. Essa tese então começa a pavimentar o abismo do primeiro problema — a falta de conhecimento — através de uma extensa exploração experimental de dois dos pilares fundamentais da programação concorrente: (1) coleções thread-safe e (2) construções para o gerenciamento de threads. Através de uma lista de achados que não são sempre óbvios, esta tese ilumina o relacionamento entre escolhas de design de código paralelo com seu consumo de energia. Esta tese começa então a pavimentar a lacuna do segundo problema — a falta de ferramentas. Lições aprendidas em um dos estudos anteriores mostraram que várias tarefas do arcabouço ForkJoin operam em estrutura de dados indexáveis, com sub-tarefas operando somente em parte dessa estrutura de dados. Uma solução ingênua é de copiar parta da estrutura de dados e utiliza-la na computação sub-sequente. Em um arcabouço recursivo como o ForkJoin, dado uma representação baseada em arrays, cada chamada recursiva criará n novos arrays, onde n é a profundidade do fork. Como solução, esta tese apresenta uma refatoração que, ao invés de copiar parte da estrutura de dados, ela compartilha-a, possibilitando que sub-tarefas operem em partições contíguas da estrutura de dados. Essa refatoração foi avaliada em 15 projetos de código aberto, a qual foi capaz de economizar energia em todos os casos (média de 12% de economia). A versão refatorada foi enviada aos mantenedores do projeto original e, durante um período de 40 dias, 7 dos 9 mantenedores que responderam aos patches enviados já haviam aceitado-os e integrado-os. Discussões durante o processo de integração revelaram que desenvolvedores não estão cientes desta otimização. Esta tese então implementou essa refatoração como um plug-in da IDE Eclipse de forma que outros desenvolvedores possam (1) detectar usos de cópia em cenários o quais seriam beneficiais o uso do modelo de compartilhamento and (2) refatorar o código de forma automática.
Niles, Duane Francis Jr. "Improving Performance of Highly-Programmable Concurrent Applications by Leveraging Parallel Nesting and Weaker Isolation Levels." Thesis, Virginia Tech, 2015. http://hdl.handle.net/10919/54557.
Full textMaster of Science
Noghani, Waheed Bazazan. "An investigation into the implementation of a cost-effective ASP architecture using VLSI and WSI technologies and its effect on modular-MPC systems." Thesis, Brunel University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.295196.
Full textSinha, Udayan Prabir. "Memory Management Error Detection in Parallel Software using a Simulated Hardware Platform." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-219606.
Full textMinneshanteringsfel i parallell mjukvara som exekverar på flerkärniga arkitekturer kan vara svåra att detektera, samt kostsamma att åtgärda. Exempel på fel kan vara användning av ej initialiserat minne, minnesläckage, samt att data blir överskrivna av en process som inte är ägare till de data som skrivs över. Om minneshanteringsfel kan detekteras i ett tidigt skede, t ex genom att använda en simulator, som körs innan mjukvaran har levererats och integrerats i en produkt, skulle man kunna erhålla signifikanta kostnadsbesparingar. Detta examensarbete undersöker och utvecklar metoder för detektion av ej initialiserat minne i mjukvara som körs på en virtuell plattform. Den virtuella plattformen innehåller modeller av delar av den digitala hårdvara, för basband och radio, som finns i en Ericsson radiobasstation. Modellerna är bit-exakta representationer av motsvarande hårdvarublock, och innefattar processorer och periferienheter. Den virtuella plattformen används av Ericsson för utveckling och integration av mjukvara. Det finns verktyg, exempelvis Memcheck (Valgrind), samt MemorySanitizer och AddressSanitizer (Clang), som kan användas för att detektera minneshanteringsfel. Egenskaper hos sådana verktyg har undersökts, och algoritmer för detektion av minneshanteringsfel har utvecklats, för en specifik processor och dess instruktioner. Algoritmerna har implementerats i en virtuell plattform, och kravställningar och design-överväganden som speglar den tillämpnings-specifika instruktionsrepertoaren för den valda processorn, har behandlats. En prototyp-implementation av presentation av minneshanteringsfel, där källkodsraderna samt anropsstacken för de platser där fel har hittats pekas ut, har utvecklats, med användning av en debugger. Ett experiment, som använder sig av ett för ändamålet utvecklat program, har använts för att utvärdera feldetektions-förmågan för de algoritmer som implementerats i den virtuella plattformen, samt för att jämföra med feldetektions-förmågan hos Memcheck. De algoritmer som implementerats i den virtuella plattformen kan, för det program som används, detektera alla kända fel, förutom ett. Algoritmerna rapporterar också falska felindikeringar. Dessa rapporter är huvudsakligen ett resultat av att den aktuella implementationen har begränsad kunskap om det operativsystem som används på den simulerade processorn.
Books on the topic "Concurrent/parallel systems and technologies"
Press, ACM, ed. Resources in parallel and concurrent systems. New York: ACM Press, 1991.
Find full textservice), SpringerLink (Online, ed. Understanding Concurrent Systems. London: Springer-Verlag London Limited, 2011.
Find full text1938-, Rattray C., British Computer Society, and BCS-FACS Workshop on Specification and Verification of Concurrent Systems (1988 : University of Stirling), eds. Specification and verification of concurrent systems. London: Springer-Verlag, 1990.
Find full textHinchey, Michael G. Concurrent systems: Formal development in CSP. London: McGraw-Hill, 1995.
Find full text1948-, Crowe David, and Strain-Clark Peter 1945-, eds. Specification and design of concurrent systems. London: McGraw-Hill Book Co., 1994.
Find full textJalote, P. Atomic actions in concurrent systems. Urbana, Ill: Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1985.
Find full textConcurrent and real-time systems: The CSP approach. Chichester: John Wiley, 2000.
Find full textJuan, Eric Y. T. Compositional verification of concurrent and real-time systems. Boston: Kluwer Academic Publishers, 2002.
Find full textJuan, Eric Y. T. Compositional verification of concurrent and real-time systems. Boston: Kluwer Academic Publishers, 2002.
Find full text1934-, Lauer Peter E., ed. Specification and analysis of concurrent systems: The COSY approach. Berlin: Springer-Verlag, 1992.
Find full textBook chapters on the topic "Concurrent/parallel systems and technologies"
Song, Bo, Huaxin Zeng, and Liquan Yue. "On Concurrent Multi-port Test System for Routers and Its Support Tools." In Parallel and Distributed Computing: Applications and Technologies, 469–83. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30501-9_95.
Full textMilner, R. "Parallel combinator reduction machine." In The Analysis of Concurrent Systems, 121–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-16047-7_41.
Full textSleeckx, E., P. Raiteri, J. L. T. Santos, S. Tilly, J. Frech, R. Menges, U. Eigenmann, et al. "Enabling Technologies II: CONSENS Tools." In Concurrent Simultaneous Engineering Systems, 157–284. London: Springer London, 1996. http://dx.doi.org/10.1007/978-1-4471-1477-2_5.
Full textKessler, S. "Enabling Technologies I: The CONSENS Platform." In Concurrent Simultaneous Engineering Systems, 103–55. London: Springer London, 1996. http://dx.doi.org/10.1007/978-1-4471-1477-2_4.
Full textDembiński, Piotr, Wojciech Penczek, and Agata Pólrola. "Automated Verification of Infinite State Concurrent Systems." In Parallel Processing and Applied Mathematics, 247–55. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-48086-2_27.
Full textHoge, Christian, Dan Keith, and Allen D. Malony. "Client-Side Task Support in Matlab for Concurrent Distributed Execution." In Distributed and Parallel Systems, 113–22. Boston, MA: Springer US, 2007. http://dx.doi.org/10.1007/978-0-387-69858-8_12.
Full textKennaway, J. R., and M. R. Sleep. "Syntax and informal semantics of DyNe, a parallel language." In The Analysis of Concurrent Systems, 222–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-16047-7_49.
Full textMosses, Peter. "A solution to problem 7 — parallel combinator reduction machine —." In The Analysis of Concurrent Systems, 354–58. Berlin, Heidelberg: Springer Berlin Heidelberg, 1985. http://dx.doi.org/10.1007/3-540-16047-7_57.
Full textJesshope, Chris, Gajinder Panesar, and Jelio Yantchev. "Operating Systems and Strategies for Highly Concurrent Systems." In The Dawn of Massively Parallel Processing in Meteorology, 188–213. Berlin, Heidelberg: Springer Berlin Heidelberg, 1990. http://dx.doi.org/10.1007/978-3-642-84020-3_13.
Full textUeda, Kazunori. "Experiences with strong moding in concurrent logic/constraint programming." In Parallel Symbolic Languages and Systems, 134–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0023059.
Full textConference papers on the topic "Concurrent/parallel systems and technologies"
Jin Guo, Mingyuan Liu, and Lifang Liu. "Research on the Performance Analysis of the Concurrent System." In Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05). IEEE, 2005. http://dx.doi.org/10.1109/pdcat.2005.206.
Full textCosta Neto, José Craveiro da, Hélio Crestana Guardia, and Liria Matsumoto Sato. "Integração de um Banco de Dados e um Data Warehouse sobre um Sistema de Arquivos Paralelos." In Workshop em Sistemas Computacionais de Alto Desempenho. Sociedade Brasileira de Computação, 2001. http://dx.doi.org/10.5753/wscad.2001.19130.
Full textBesa, Juan, and Yadran Eterovic. "A Concurrent Red Black Tree." In Parallel and Distributed Computing and Systems. Calgary,AB,Canada: ACTAPRESS, 2011. http://dx.doi.org/10.2316/p.2011.757-056.
Full textBesa, Juan, and Yadran Eterovic. "A Concurrent Red Black Tree." In Parallel and Distributed Computing and Systems. Calgary,AB,Canada: ACTAPRESS, 2012. http://dx.doi.org/10.2316/p.2012.757-056.
Full textBercha, Frank G. "Arctic EER Today." In SNAME 9th International Conference and Exhibition on Performance of Ships and Structures in Ice. SNAME, 2010. http://dx.doi.org/10.5957/icetech-2010-106.
Full textFu, Jing, and Kunlong Zhang. "Practical Concurrent Self-Organizing Lists." In 2017 IEEE 23rd International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2017. http://dx.doi.org/10.1109/icpads.2017.00058.
Full textGrov, Gudmund, Greg Michaelson, and Andrew Ireland. "Formal verification of concurrent scheduling strategies using TLA." In 2007 International Conference on Parallel and Distributed Systems. IEEE, 2007. http://dx.doi.org/10.1109/icpads.2007.4447839.
Full textPalumbo, Francesca, Danilo Pani, Andrea Congiu, and Luigi Raffo. "Concurrent hybrid switching for massively parallel systems-on-chip." In the 9th conference. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2212908.2212933.
Full textKhezri, Meysam, Mehdi Agha Sarram, and Fazlollah Adibniya. "Simplifying Concurrent Programming of Networked Embedded Systems." In 2008 IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA). IEEE, 2008. http://dx.doi.org/10.1109/ispa.2008.138.
Full textMatyasik, Piotr, and Marcin Szpyrka. "Formal Modelling and Verification of Concurrent Systems with XCCS." In 2008 International Symposium on Parallel and Distributed Computing. IEEE, 2008. http://dx.doi.org/10.1109/ispdc.2008.26.
Full textReports on the topic "Concurrent/parallel systems and technologies"
Ammar, H. H., Y. S. Fong, R. Mukundan, and C. A. Pomalaza-Raez. Performance Evaluation of Parallel Algorithms and Architectures in Concurrent Multiprocessor Systems. Fort Belvoir, VA: Defense Technical Information Center, September 1988. http://dx.doi.org/10.21236/ada203982.
Full textGannon, Dennis. Transformations of Concurrent Algorithms for Highly Parallel Systems: A One Year Project Summary Report. Fort Belvoir, VA: Defense Technical Information Center, October 1987. http://dx.doi.org/10.21236/ada190236.
Full textMarkova, Oksana M., Serhiy O. Semerikov, Andrii M. Striuk, Hanna M. Shalatska, Pavlo P. Nechypurenko, and Vitaliy V. Tron. Implementation of cloud service models in training of future information technology specialists. [б. в.], September 2019. http://dx.doi.org/10.31812/123456789/3270.
Full textBendikov, Michael, and Thomas C. Harmon. Development of Agricultural Sensors Based on Conductive Polymers. United States Department of Agriculture, August 2006. http://dx.doi.org/10.32747/2006.7591738.bard.
Full textVehicle Surge Reduction Technology during Towing in Parallel HEV Pickup Truck. SAE International, March 2022. http://dx.doi.org/10.4271/2022-01-0613.
Full text