Academic literature on the topic 'Concurrent/parallel systems and technologies'

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 '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"

1

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 text
Abstract:
Most programming courses taught today are focused on managing batch-oriented problems. It is primarily because parallel computers are not commonly available, therefore problems with concurrent nature could not be explored. This consequence, at the same time, causes student's under preparation to meet the challenge of modern multi-process computation technologies. This article demonstrates an easy solution for implementing concurrent programming projects in computer labs. This solution does not require special hardware support or special programming languages. The goal is to facilitate a means to deal with the concept and usefulness of multi-process software systems in the early stage of computer science curriculum. We also include detailed descriptions on a few creative and interesting concurrent examples to illustrate this idea.
APA, Harvard, Vancouver, ISO, and other styles
2

Chaudhary, 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 text
Abstract:
NoSQL databases (commonly interpreted by developers as „not only SQL databases‟ and not „no SQL‟) is an emerging alternative to the most widely used relational databases. As the name suggests, it does not completely replace SQL but compliments it in such a way that they can co-exist. In this paper we will be discussing the NoSQL data model, types of NoSQL data stores, characteristics and features of each data store, query languages used in NoSQL, advantages and disadvantages of NoSQL over RDBMS and the future prospects of NoSQL. Motivation/Background:NoSQL systems exhibit the ability to store and index arbitrarily big data sets while enabling a large amount of concurrent user requests. Method:Many people think NoSQL is a derogatory term created to poke at SQL. In reality, the term means Not Only SQL. The idea is that both technologies can coexist and each has its place. Results:Large-scale data processing (parallel processing over distributed systems); Embedded IR (basic machine-to-machine information look-up & retrieval); Exploratory analytics on semi-structured data (expert level); Large volume data storage (unstructured, semi-structured, small-packet structured). Conclusions:This study report motivation to provide an independent understanding of the strengths and weaknesses of various NoSQL database approaches to supporting applications that process huge volumes of data; as well as to provide a global overview of this non-relational NoSQL databases.
APA, Harvard, Vancouver, ISO, and other styles
3

Kaur 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 text
Abstract:
The rapid advancement of the internet has given birth to many technologies. Cloud computing is one of the most emerging technology which aim to process large scale data by using the computational capabilities of shared resources. It gives support to the distributed parallel processing. Using cloud computing, we can process data by paying according to its uses which eliminates the requirement of device by individual users. As cloud computing grows, more users get attracted towards it. However, providing an efficient execution time and load distribution is a major challenging issue in the distributed systems. In our approach, weighted round robin algorithm is used and benefits of Fibonacci sequence is combined which results in better execution time than static round robin. Relevant virtual machines are chosen and jobs are assigned to them. Also, number of resources being utilized concurrently is reduced, which leads to resource saving thereby reducing the cost. There is no need to deploy new resources as resources such as virtual machines are already available.
APA, Harvard, Vancouver, ISO, and other styles
4

Thompson, 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 text
APA, Harvard, Vancouver, ISO, and other styles
5

Massei, 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 text
Abstract:
As human populations grow, conflicts with wildlife increase. Concurrently, concerns about the welfare, safety and environmental impacts of conventional lethal methods of wildlife management restrict the options available for conflict mitigation. In parallel, there is increasing interest in using fertility control to manage wildlife. The present review aimed at analysing trends in research on fertility control for wildlife, illustrating developments in fertility-control technologies and delivery methods of fertility-control agents, summarising the conclusions of empirical and theoretical studies of fertility control applied at the population level and offering criteria to guide decisions regarding the suitability of fertility control to mitigate human–wildlife conflicts. The review highlighted a growing interest in fertility control for wildlife, underpinned by increasing numbers of scientific studies. Most current practical applications of fertility control for wild mammals use injectable single-dose immunocontraceptive vaccines mainly aimed at sterilising females, although many of these vaccines are not yet commercially available. One oral avian contraceptive, nicarbazin, is commercially available in some countries. Potential new methods of remote contraceptive delivery include bacterial ghosts, virus-like particles and genetically modified transmissible and non-transmissible organisms, although none of these have yet progressed to field testing. In parallel, new species-specific delivery systems have been developed. The results of population-level studies of fertility control indicated that this approach may increase survival and affect social and spatial behaviour of treated animals, although the effects are species- and context-specific. The present studies suggested that a substantial initial effort is generally required to reduce population growth if fertility control is the sole wildlife management method. However, several empirical and field studies have demonstrated that fertility control, particularly of isolated populations, can be successfully used to limit population growth and reduce human–wildlife conflicts. In parallel, there is growing recognition of the possible synergy between fertility control and disease vaccination to optimise the maintenance of herd immunity in the management of wildlife diseases. The review provides a decision tree that can be used to determine whether fertility control should be employed to resolve specific human–wildlife conflicts. These criteria encompass public consultation, considerations about animal welfare and feasibility, evaluation of population responses, costs and sustainability.
APA, Harvard, Vancouver, ISO, and other styles
6

Stotts, 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 text
APA, Harvard, Vancouver, ISO, and other styles
7

Taylor, 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 text
APA, Harvard, Vancouver, ISO, and other styles
8

Malyshkin, 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 text
APA, Harvard, Vancouver, ISO, and other styles
9

Malyshkin, 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 text
APA, Harvard, Vancouver, ISO, and other styles
10

Malyshkin, 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 text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Concurrent/parallel systems and technologies"

1

Sobel, Ann E. Kelley. "Modular verification of concurrent systems /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487267546983528.

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

Chai, 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 text
APA, Harvard, Vancouver, ISO, and other styles
3

Wabenhorst, 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 text
APA, Harvard, Vancouver, ISO, and other styles
4

Vigder, Mark (Mark Ronald) Carleton University Dissertation Engineering Electrical. "Applying formal techniques to the design of concurrent systems." Ottawa, 1992.

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

Zilio, 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 text
APA, Harvard, Vancouver, ISO, and other styles
6

Menon, 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 text
APA, Harvard, Vancouver, ISO, and other styles
7

PINTO, 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 text
Abstract:
Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2016-04-06T13:27:55Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) versao_biblioteca.pdf: 3051240 bytes, checksum: ac1a91e08d64c78a372cb0e151bcb7c7 (MD5)
Made 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.
APA, Harvard, Vancouver, ISO, and other styles
8

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 text
Abstract:
The recent development of multi-core computer architectures has largely affected the creation of everyday applications, requiring the adoption of concurrent programming to significantly utilize the divided processing power of computers. Applications must be split into sections able to execute in parallel, without any of these sections conflicting with one another, thereby necessitating some form of synchronization to be declared. The most commonly used methodology is lock-based synchronization; although, to improve performance the most, developers must typically form complex, low-level implementations for large applications, which can easily create potential errors or hindrances. An abstraction from database systems, known as transactions, is a rising concurrency control design aimed to circumvent the challenges with programmability, composability, and scalability in lock-based synchronization. Transactions execute their operations speculatively and are capable of being restarted (or rolled back) when there exist conflicts between concurrent actions. As such issues can occur later in the lifespans of transactions, entire rollbacks are not that effective for performance. One particular method, known as nesting, was created to counter that drawback. Nesting is the act of enclosing transactions within other transactions, essentially dividing the work into pieces called sub-transactions. These sub-transactions can roll back without affecting the entire main transaction, although general nesting models only allow one sub-transaction to perform work at a time. The first main contribution in this thesis is SPCN, an algorithm that parallelizes nested transactions while automatically processing any potential conflicts that may arise, eliminating the burden of additional processing from the application developers. Two versions of SPCN exist: Strict, which enforces the sub-transactions' work to be made visible in a serialized order; and Relaxed, which allows sub-transactions to distribute their information immediately as they finish (therefore invalidation may occur after-the-fact and must be handled). Despite the additional logic required by SPCN, it outperforms traditional closed nesting by 1.78x at the lowest and 3.78x at the highest in the experiments run. Another method to alter transactional execution and boost performance is to relax the rules of visibility for parallel operations (known as their isolation). Depending on the application, correctness is not broken even if some transactions see external work that may later be undone due to a rollback, or if an object is written while another transaction is using an older instance of its data. With lock-based synchronization, developers would have to explicitly design their application with varying amounts of locks, and different lock organizations or hierarchies, to change the strictness of the execution. With transactional systems, the processing performed by the system itself can be set to utilize different rulings, which can change the performance of an application without requiring it to be largely redesigned. This notion leads to the second contribution in this thesis: AsR, or As-Serializable transactions. Serializability is the general form of isolation or strictness for transactions in many applications. In terms of execution, its definition is equivalent to only one transaction running at a time in a given system. Many transactional systems use their own internal form of locking to create Serializable executions, but it is typically too strict for many applications. AsR transactions allow the internal processing to be relaxed while additional meta-data is used external to the system, without requiring any interaction from the developer or any changes to the given application. AsR transactions offer multiple orders of magnitude more in throughput in highly-contentious scenarios, due to their capability to outlast traditional levels of isolation.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
9

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 text
APA, Harvard, Vancouver, ISO, and other styles
10

Sinha, 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 text
Abstract:
Memory management errors in concurrent software running on multi-core architectures can be difficult and costly to detect and repair. Examples of errors are usage of uninitialized memory, memory leaks, and data corruptions due to unintended overwrites of data that are not owned by the writing entity. If memory management errors could be detected at an early stage, for example when using a simulator before the software has been delivered and integrated in a product, significant savings could be achieved. This thesis investigates and develops methods for detection of usage of uninitialized memory in software that runs on a virtual hardware platform. The virtual hardware platform has models of Ericsson Radio Base Station hardware for baseband processing and digital radio processing. It is a bit-accurate representation of the underlying hardware, with models of processors and peripheral units, and it is used at Ericsson for software development and integration. There are tools available, such as Memcheck (Valgrind), and MemorySanitizer and AddressSanitizer (Clang), for memory management error detection. The features of such tools have been investigated, and memory management error detection algorithms were developed for a given processor’s instruction set. The error detection algorithms were implemented in a virtual platform, and issues and design considerations reflecting the application-specific instruction set architecture of the processor, were taken into account. A prototype implementation of memory error presentation with error locations mapped to the source code of the running program, and presentation of stack traces, was done, using functionality from a debugger. An experiment, using a purpose-built test program, was used to evaluate the error detection capability of the algorithms in the virtual platform, and for comparison with the error detection capability of Memcheck. The virtual platform implementation detects all known errors, except one, in the program and reports them to the user in an appropriate manner. There are false positives reported, mainly due to the limited awareness about the operating system used on the simulated processor
Minneshanteringsfel 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.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Concurrent/parallel systems and technologies"

1

Press, ACM, ed. Resources in parallel and concurrent systems. New York: ACM Press, 1991.

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

service), SpringerLink (Online, ed. Understanding Concurrent Systems. London: Springer-Verlag London Limited, 2011.

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

1938-, 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 text
APA, Harvard, Vancouver, ISO, and other styles
4

Hinchey, Michael G. Concurrent systems: Formal development in CSP. London: McGraw-Hill, 1995.

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

1948-, Crowe David, and Strain-Clark Peter 1945-, eds. Specification and design of concurrent systems. London: McGraw-Hill Book Co., 1994.

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

Jalote, P. Atomic actions in concurrent systems. Urbana, Ill: Dept. of Computer Science, University of Illinois at Urbana-Champaign, 1985.

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

Concurrent and real-time systems: The CSP approach. Chichester: John Wiley, 2000.

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

Juan, Eric Y. T. Compositional verification of concurrent and real-time systems. Boston: Kluwer Academic Publishers, 2002.

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

Juan, Eric Y. T. Compositional verification of concurrent and real-time systems. Boston: Kluwer Academic Publishers, 2002.

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

1934-, Lauer Peter E., ed. Specification and analysis of concurrent systems: The COSY approach. Berlin: Springer-Verlag, 1992.

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

Book chapters on the topic "Concurrent/parallel systems and technologies"

1

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 text
APA, Harvard, Vancouver, ISO, and other styles
2

Milner, 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 text
APA, Harvard, Vancouver, ISO, and other styles
3

Sleeckx, 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 text
APA, Harvard, Vancouver, ISO, and other styles
4

Kessler, 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 text
APA, Harvard, Vancouver, ISO, and other styles
5

Dembiń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 text
APA, Harvard, Vancouver, ISO, and other styles
6

Hoge, 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 text
APA, Harvard, Vancouver, ISO, and other styles
7

Kennaway, 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 text
APA, Harvard, Vancouver, ISO, and other styles
8

Mosses, 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 text
APA, Harvard, Vancouver, ISO, and other styles
9

Jesshope, 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 text
APA, Harvard, Vancouver, ISO, and other styles
10

Ueda, 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 text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Concurrent/parallel systems and technologies"

1

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 text
APA, Harvard, Vancouver, ISO, and other styles
2

Costa 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 text
Abstract:
Nowadays, there is an increasing demand for data warehousing systems, which are computational systems to support decision making based on information stored in a data warehouse. In order to provide such systems with high performance, a concurrent database system, called CDBS, has been proposed, CDBS integrates parallel database and warehousing technologies, and contains a data definition and manipulation function library that makes it possible to create, modify, and search on parallel databases and warehouses. In order to guarantee high performance, CDBS uses a parallel file system, called NPFS, which organizes data in such a way that its data manipulation functions can be executed rapidly. In this paper, we describe CDBS and present a case study in which the use of parallelism in databases and warehousing systems is required in order to achieve high performance. Resides, we discuss future rescarch opportunities related to the specification, design and implementation of new CDBS library functions, as well as the main contributions of this work.
APA, Harvard, Vancouver, ISO, and other styles
3

Besa, 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 text
APA, Harvard, Vancouver, ISO, and other styles
4

Besa, 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 text
APA, Harvard, Vancouver, ISO, and other styles
5

Bercha, 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 text
Abstract:
Technologies, engineering and analysis, and regulatory provisions relating to arctic Escape Evacuation and Rescue (EER) today and in development are reviewed. Current national and international regulatory performance based regime has necessitated the development of tools for the evaluation and setting of performance based goals such as availability and reliability requirements, mirrored in current Transport Canada and ISO standards. To facilitate setting of reliability targets in the Canadian standards, a multifaceted research and development program was initiated in parallel with its regulatory developments. Full scale manned and model tests, engineering and computer simulation, and world wide consultations and studies on human performance in life threatening conditions, comprise this R&D programme. Concurrently, industry and the private sector have addressed the frontier and arctic EER needs through analyses, development of novel systems, and participation in framing performance based standards. Use of conventional EER systems and technologies was found to have limited applicability in ice populated waters, requiring the development of systems and procedures suited to the environmental, operational, and logistical requirements of arctic offshore regions. The paper summarizes available and emerging regulatory, modeling and research, and technological developments in arctic EER and gives recommendations on a number of promising directions.
APA, Harvard, Vancouver, ISO, and other styles
6

Fu, 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 text
APA, Harvard, Vancouver, ISO, and other styles
7

Grov, 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 text
APA, Harvard, Vancouver, ISO, and other styles
8

Palumbo, 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 text
APA, Harvard, Vancouver, ISO, and other styles
9

Khezri, 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 text
APA, Harvard, Vancouver, ISO, and other styles
10

Matyasik, 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 text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Concurrent/parallel systems and technologies"

1

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 text
APA, Harvard, Vancouver, ISO, and other styles
2

Gannon, 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 text
APA, Harvard, Vancouver, ISO, and other styles
3

Markova, 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 text
Abstract:
Leading research directions are defined on the basis of self-analysis of the study results on the use of cloud technologies in training by employees of joint research laboratory “Сloud technologies in education” of Kryvyi Rih National University and Institute of Information Technology and Learning Aids of the NAES of Ukraine in 2009-2018: cloud learning technologies, cloud technologies of blended learning, cloud-oriented learning environments, cloud-oriented methodological systems of training, the provision of cloud-based educational services. The ways of implementation SaaS, PaaS, IaaS cloud services models which are appropriate to use in the process of studying the academic disciplines of the cycles of mathematical, natural science and professional and practical training of future specialists in information technology are shown, based on the example of software engineering, computer science and computer engineering. The most significant advantages of using cloud technologies in training of future information technology specialists are definite, namely, the possibility of using modern parallel programming tools as the basis of cloud technologies. Conclusions are drawn; the direction of further research is indicated: designing a cloud-oriented learning environment for future specialists in computer engineering, identifying trends in the development of cloud technologies in the professional training and retraining of information technology specialists, developing a methodology for building the research competencies of future software engineering specialists by using cloud technologies.
APA, Harvard, Vancouver, ISO, and other styles
4

Bendikov, 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 text
Abstract:
In this 1-year feasibility study, we tried polymerization of several different monomers, commercial as well as novel, specially designed and synthesized for this project in the presence of the nitrate ion to produce imprinted conductive polymers. Polymers 1 and 2 (shown below) produced a response to nitrate, but one inferior to that produced by a polypyrrole (Ppy)-based sensor (which we demonstrated prior to this study). Thus, we elected to proceed with improving the stability of the Ppy-based sensor. In order to improve stability of the Ppy-based sensor, we created a two-layer design which includes nitrate-doped Ppy as an inner layer, and nitrate-doped PEDOT as the outer layer. PEDOT is known for its high environmental stability and conductivity. This design has demonstrated promise, but is still undergoing optimization and stability testing. Previously we had failed to create nitrate-doped PEDOT in the absence of a Ppy layer. Nitrate-doped PEDOT should be very promising for sensor applications due to its high stability and exceptional sensing properties as we showed previously for sensing of perchlorate ions (by perchlorate-doped PEDOT). During this year, we have succeeded in preparing nitrate-doped PEDOT (4 below) by designing a new starting monomer (compound 3 below) for polymerization. We are currently testing this design for nitrate sensing. In parallel with the fabrication design studies, we fabricated and tested nitrate-doped Ppy sensors in a series of flow studies under laboratory and field conditions. Nitrate-doped Ppy sensors are less stable than is desirable but provide excellent nitrate sensing characteristics for the short-term experiments focusing on packaging and deployment strategies. The fabricated sensors were successfully interfaced with a commercial battery-powered self-logging (Onset Computer Hobo Datalogger) and a wireless data acquisition and transmission system (Crossbow Technologies MDA300 sensor interface and Mica2 wireless mote). In a series of flow-through experiments with water, the nitrate-doped Ppy sensors were exposed to pulses of dissolved nitrate and compared favorably with an expensive commercial sensor. In 24-hour field tests in both Merced and in Palmdale, CA agricultural soils, the sensors responded to introduced nitrate pulses, but with different dynamics relative to the larger commercial sensors. These experiments are on-going but suggest a form factor (size, shape) effect of the sensor when deployed in a porous medium such as soil. To fill the need for a miniature reference electrode, we identified and tested one commercial version (Cypress Systems, ESA Mini-reference electrode) which works well but is expensive ($190). To create an inexpensive miniature reference electrode, we are exploring the use of AgCl-coated silver wire. This electrode is not a “true” reference electrode; however, it can calibrated once versus a commercial reference electrode at the time of deployment in soil. Thus, only one commercial reference electrode would suffice to support a multiple sensor deployment.
APA, Harvard, Vancouver, ISO, and other styles
5

Vehicle 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
Abstract:
This paper proposes a technology to reduce vehicle surge during towing that utilizes motors and shifting to help ensure comfort in a parallel HEV pickup truck. Hybridization is one way to reduce fuel consumption and help realize carbon neutrality. Parallel HEVs have advantages in the towing, hauling, and high-load operations often carried out by pickup trucks, compared to other HEV systems. Since the engine, motor, torque converter, and transmission are connected in series in a parallel HEV, vehicle surge may occur when the lockup clutch is engaged to enhance fuel efficiency, similar to conventional powertrains. Vehicle surge is a low-frequency vibration phenomenon. In general, the source is torque fluctuation caused by the engine and tires, with amplification provided by first-order torsional driveline resonance, power plant resonance, suspension resonance, and cabin resonance. This vibration is amplified more during towing. Therefore, this paper proposes two surge reduction technologies to help achieve fuel efficiency and surge at the same time during towing. One technology is a gear shift control that avoids engine operating zones where two or more resonance frequencies coincide, which is realized by changing the equivalent inertia via appropriate gear selection. The second technology is an anti-vibration control, which makes effective use of the hybrid system motors by adding motor torque to suppress the relative displacement between the driveline and the tires.
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!

To the bibliography