Дисертації з теми "Parallel systems and technologies"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Parallel systems and technologies".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
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.
Повний текст джерелаKhan, Muhammad Sikandar Lal. "Enabling physical action in computer mediated communication : an embodied interaction approach." Licentiate thesis, Umeå universitet, Institutionen för tillämpad fysik och elektronik, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-108569.
Повний текст джерелаJakušev, Aleksandr. "Diferencialinių lygčių ir jų sistemų skaitinio sprendimo algoritmų lygiagretinimo technologijos kūrimas, analizė ir taikymai." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2009. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2008~D_20090217_160637-75872.
Повний текст джерелаThe new parallelization technology is presented in this work. The technology is suitable for parallelization of linear algebra problems that arise during solution of PDE and PDE systems. The new technology combines the strong points of "data parallel" and "global memory" parallel programming models. Using the pecularities of the problems of a given class, the technology allows to write effective code easily, with the addition of the possibility for semi-automatic parallelization. The work consists of 3 parts: the review of existing technologies, the description of the new one, various applications.
Fagg, Graham Edward. "Enabling technologies for parallel heterogeneous computing." Thesis, University of Reading, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266150.
Повний текст джерелаTeller, Justin Stevenson. "Scheduling Tasks on Heterogeneous Chip Multiprocessors with Reconfigurable Hardware." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1211985748.
Повний текст джерелаHulot, Carlos. "Parallel tracking systems." Thesis, University of Southampton, 1995. https://eprints.soton.ac.uk/264882/.
Повний текст джерелаJohnson, Robert David. "Parallel analytic tableaux systems." Thesis, Queen Mary, University of London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362777.
Повний текст джерелаGhanemi, Salim. "Non-numerical parallel algorithms for asynchronous parallel computer systems." Thesis, Loughborough University, 1987. https://dspace.lboro.ac.uk/2134/28016.
Повний текст джерелаJeong, Byeong-Soo. "Indexing in parallel database systems." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/8189.
Повний текст джерелаBraungardt, Sibylle. "Complex systems for quantum technologies." Doctoral thesis, Universitat Politècnica de Catalunya, 2011. http://hdl.handle.net/10803/35871.
Повний текст джерелаSharma, Gunjana. "Heterogeneous Technologies for Microfluidic Systems." Doctoral thesis, Uppsala universitet, Mikrosystemteknik, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-131109.
Повний текст джерелаFartaria, Luís Alberto Jorge. "Energy systems for transportation technologies." Master's thesis, Universidade de Aveiro, 2011. http://hdl.handle.net/10773/8726.
Повний текст джерелаThe objective of the work developed in this master thesis is to implement in one system for the transport people in underdeveloped mountainous regions in Nepal. This is based on the idea of Asso. Prof. of Physics Lok Bahadur Baral from Tribhuvan University in Kathmandu (Nepal), who started to develop a gravitational potential energy for transportation. His work was conducted under supervision of Prof. Kartnig at the Department of Engineering Design for Transport and Conveying Systems at Vienna University of Technology in collaboration with Tribhuvan University. This part of the project is to develop the power supply for the infrastructure created by David Guerrero in his bachelor thesis. The infrastructure is already designed to receive one engine that will give the power necessary for this to be successfully accomplished. For the engine to work we have to have some energy supply in our system, that energy requirement will originate from a variation of renewable energy technologies.
Nader, Babak. "Parallel solution of sparse linear systems." Full text open access at:, 1987. http://content.ohsu.edu/u?/etd,138.
Повний текст джерелаMenich, Ronald Paul. "Resource allocation in parallel processing systems." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/28049.
Повний текст джерелаWesson, Paul John. "Parallel algorithms for systems of equations." Thesis, University of Oxford, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.315776.
Повний текст джерелаManoharan, Sathiamoorthy. "Task assignment in parallel processor systems." Thesis, University of Edinburgh, 1993. http://hdl.handle.net/1842/6568.
Повний текст джерелаBeaumont, Anthony Joseph. "Scheduling in Or-parallel PROLOG systems." Thesis, University of Bristol, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.281798.
Повний текст джерелаSmith, Mark. "Spatial reaction systems on parallel supercomputers." Thesis, University of Edinburgh, 1994. http://hdl.handle.net/1842/12985.
Повний текст джерелаKelly, Thomas. "Optimizing hardware granularity in parallel systems." Thesis, University of Edinburgh, 1995. http://hdl.handle.net/1842/15141.
Повний текст джерелаRoque, Pedro Miguel da Silva. "Contraint solving on massively parallel systems." Doctoral thesis, Universidade de Évora, 2020. http://hdl.handle.net/10174/27976.
Повний текст джерелаNordin, Syarifah Zyurina. "Task scheduling in parallel processor systems." Thesis, Curtin University, 2011. http://hdl.handle.net/20.500.11937/2510.
Повний текст джерелаWatkins, Stanley Hugh. "A porting methodology for parallel database systems." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 1993. http://handle.dtic.mil/100.2/ADA275256.
Повний текст джерелаHysing, Andreas Dreyer. "Parallel Seismic Inversion for Shared Memory Systems." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2010. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-11795.
Повний текст джерелаNordén, Markus. "Parallel PDE Solvers on cc-NUMA Systems." Licentiate thesis, Uppsala universitet, Avdelningen för teknisk databehandling, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-86307.
Повний текст джерелаLiu, Chi-Cheng. "Implementation of parallel intelligent information retrieval systems." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq30509.pdf.
Повний текст джерелаNordén, Markus. "Parallel PDE solvers on cc-NUMA systems /." Uppsala : Univ. : Dept. of Information Technology, Univ, 2004.
Знайти повний текст джерелаHopper, Michael A. "A compiler framework for multithreaded parallel systems." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/15638.
Повний текст джерелаTambouris, Efthimios. "Performance and scalability analysis of parallel systems." Thesis, Brunel University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.341665.
Повний текст джерелаMatooane, ʾMantśika Amelia. "Parallel systems in symbolic and algebraic computation." Thesis, University of Cambridge, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.621402.
Повний текст джерелаDempster, Euan W. "Performance prediction for parallel database management systems." Thesis, Heriot-Watt University, 2004. http://hdl.handle.net/10399/341.
Повний текст джерелаMarriott, Derek Garron. "Analysis of safety-critical parallel software systems." Thesis, University of Sheffield, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.388710.
Повний текст джерелаShao, Jianhua. "A study of parallel deductive database systems." Thesis, University of Ulster, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302834.
Повний текст джерелаTsimashenka, Iryna. "Reducing subtask dispersion in parallel queueing systems." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/24702.
Повний текст джерелаGustavsson, Andreas. "Static Execution Time Analysis of Parallel Systems." Doctoral thesis, Mälardalens högskola, Inbyggda system, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-31399.
Повний текст джерелаDen strategi som historiskt sett använts för att öka processorers prestanda (genom ökad klockfrekvens och ökad instruktionsnivåparallellism) är inte längre hållbar på grund av den ökade energikonsumtion som krävs. Därför är den nuvarande trenden inom processordesign att låta mjukvaran påverka det parallella exekveringsbeteendet. Detta görs vanligtvis genom att placera multipla processorkärnor på ett och samma processorchip. Kärnorna delar vanligtvis på några av processorchipets resurser, såsom cache-minne (och därmed också det nätverk, till exempel en buss, som ansluter kärnorna till detta minne, samt alla minnen på högre nivåer). För att utnyttja all den prestanda som denna typ av processorer erbjuder så måste mjukvaran som körs på dem kunna delas upp över de tillgängliga kärnorna. Eftersom flerkärniga processorer är standard idag så måste även realtidssystem baseras på dessa och den nämnda typen av kod. Ett realtidssystem är ett datorsystem som måste vara både funktionellt och tidsmässigt korrekt. För vissa typer av realtidssystem kan ett inkorrekt tidsmässigt beteende ha katastrofala följder. Därför är det ytterst viktigt att metoder för att analysera och beräkna säkra gränser för det tidsmässiga beteendet hos parallella datorsystem tas fram. Denna avhandling presenterar en metod för att beräkna säkra gränser för exekveringstiden hos ett givet parallellt system, och visar därmed att sådana metoder existerar. Gränssnittet till metoden är ett litet formellt definierat trådat programmeringsspråk där trådarna tillåts kommunicera och synkronisera med varandra. Metoden baseras på abstrakt exekvering för att effektivt beräkna de säkra (men ofta överskattade) gränserna för exekveringstiden. Abstrakt exekvering baseras i sin tur på abstrakta interpreteringstekniker som vida används inom tidsanalys av sekventiella datorsystem. Avhandlingen bevisar även korrektheten hos den presenterade metoden (det vill säga att de beräknade gränserna för det analyserade systemets exekveringstid är säkra) och utvärderar en prototypimplementation av den.
Worst-Case Execution Time Analysis of Parallel Systems
RALF3 - Software for Embedded High Performance Architectures
Yun, Paul M. "Parallel Bus Implementations in Satellite Communications Systems." International Foundation for Telemetering, 1988. http://hdl.handle.net/10150/615247.
Повний текст джерелаAs the volume of linkages in the satellite communications systems increases, the parallel bus between the various processors of the satellite becomes a bottle neck to transfer the commands and data. The remedies to this problem are trivial in the ground stations; however, this problem imposes severe restrictions in parallel bus implementation of the satellite communications systems. The most severe restriction is the minimization of wire connections in the physical layer to minimize the weight, size and power consumption, and also to maximize the reliability. Another restriction is the flexibility in the link layer to adapt the different characteristics of the command and data messages. In this paper, the implementation to overcome the imposed restrictions in both physical and link layer of the parallel bus will be discussed.
Millar, Dean Lee. "Parallel distributed processing in rock engineering systems." Thesis, Imperial College London, 2008. http://hdl.handle.net/10044/1/37116.
Повний текст джерелаCutts, Geoff. "Modelling and analysis of parallel information systems." Thesis, Sheffield Hallam University, 1993. http://shura.shu.ac.uk/19524/.
Повний текст джерелаDavies, Neil J. "The performance and scalability of parallel systems." Thesis, University of Bristol, 1994. http://hdl.handle.net/1983/964dec41-9a36-44ea-9cfc-f6d1013fcd12.
Повний текст джерелаGudino, Natalia. "NOVEL PARALLEL TRANSMIT SYSTEMS FOR MRI APPLICATIONS." Case Western Reserve University School of Graduate Studies / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=case1363178933.
Повний текст джерелаWu, Fei. "Parallel computational methods for constrained mechanical systems." Diss., The University of Arizona, 1997. http://hdl.handle.net/10150/282561.
Повний текст джерелаApentiik, Rowland. "Bulsa technologies and systems of thought." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/mq24571.pdf.
Повний текст джерелаHaase, Peter. "Semantic technologies for distributed information systems." Karlsruhe : Univ.-Verl. Karlsruhe, 2006. http://www.uvka.de/univerlag/volltexte/2007/195/.
Повний текст джерелаSmith, Colin Frederick. "Jellyfish Inspired Underwater Systems and Technologies." Thesis, Virginia Tech, 2011. http://hdl.handle.net/10919/76896.
Повний текст джерелаMaster of Science
Topham, N. P. "A parallel vector processing system." Thesis, University of Manchester, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.370965.
Повний текст джерелаKopek, Christopher Vincent. "Parallel intrusion detection systems for high speed networks using the divided data parallel method." Electronic thesis, 2007. http://dspace.zsr.wfu.edu/jspui/handle/10339/191.
Повний текст джерелаBrandis, Robert Craig. "IPPM : Interactive parallel program monitor." Full text open access at:, 1986. http://content.ohsu.edu/u?/etd,111.
Повний текст джерелаGrass, Thomas. "Simulation methodologies for future large-scale parallel systems." Doctoral thesis, Universitat Politècnica de Catalunya, 2017. http://hdl.handle.net/10803/461198.
Повний текст джерелаDes dels principis dels anys 2000, els sistemes d'ordinadors han experimentat una transició de sistemes d'un sol nucli a sistemes de múltiples nuclis. Mentre els sistemes d'un sol nucli incloïen només un nucli en un xip, els sistemes actuals de múltiples nuclis n'inclouen desenes, una tendència que probablement continuarà en el futur. Avui en dia, els processadors de múltiples nuclis són omnipresents. Es fan servir en totes les classes de sistemes de computació, de telèfons mòbils de baix cost fins a sistemes de computació d'alt rendiment. Dissenyar els futurs sistemes de múltiples nuclis és un repte important. L'eina principal usada pels arquitectes de computadors, tant a l'acadèmia com a la indústria, és la simulació. Simular un ordinador executant un programa típicament és múltiples ordres de magnitud més lent que executar el mateix programa en un sistema real. Per tant, es necessiten noves tècniques per accelerar la simulació i permetre l'exploració de grans espais de disseny en un temps raonable. Una manera d'accelerar la velocitat de simulació és la simulació mostrejada. La simulació mostrejada redueix el temps de simulació simulant en detall només un subconjunt representatiu d¿un programa. En aquesta tesi es presenta una anàlisi de rendiment d'una col·lecció de programes basats en tasques. Com a resultat d'aquesta anàlisi, proposem TaskPoint, una metodologia de simulació mostrejada per programes basats en tasques. Els models de programació basats en tasques poden reduir els costos de sincronització de programes paral·lels executats en sistemes de múltiples nuclis i actualment estan guanyant importància. Finalment, presentem MUSA, una metodologia de simulació per simular aplicacions executant-se en milers de nuclis d'un sistema híbrid, que consisteix en nodes de memòria compartida que formen un sistema de memòria distribuïda. El temps que requereixen les simulacions amb MUSA és comparable amb el temps que triga l'execució nativa en un sistema d'alt rendiment en producció. Les tècniques desenvolupades al llarg d'aquesta tesi permeten simular execucions de programes que abans no eren viables, tant als investigadors com als enginyers que treballen en l'arquitectura de computadors. Per tant, aquest treball habilita futura recerca en el camp d'arquitectura de sistemes de memòria compartida o distribuïda, o bé de sistemes híbrids, a gran escala.
A principios de los años 2000, los sistemas de ordenadores experimentaron una transición de sistemas con un núcleo a sistemas con múltiples núcleos. Mientras los sistemas single-core incluían un sólo núcleo, los sistemas multi-core incluyen decenas de núcleos en el mismo chip, una tendencia que probablemente continuará en el futuro. Hoy en día, los procesadores multi-core son omnipresentes. Se utilizan en todas las clases de sistemas de computación, de teléfonos móviles de bajo coste hasta sistemas de alto rendimiento. Diseñar sistemas multi-core del futuro es un reto importante. La herramienta principal usada por arquitectos de computadores, tanto en la academia como en la industria, es la simulación. Simular un computador ejecutando un programa típicamente es múltiples ordenes de magnitud más lento que ejecutar el mismo programa en un sistema real. Por ese motivo se necesitan nuevas técnicas para acelerar la simulación y permitir la exploración de grandes espacios de diseño dentro de un tiempo razonable. Una manera de aumentar la velocidad de simulación es la simulación muestreada. La simulación muestreada reduce el tiempo de simulación simulando en detalle sólo un subconjunto representativo de la ejecución entera de un programa. En esta tesis presentamos un análisis de rendimiento de una colección de programas basados en tareas. Como resultado de este análisis presentamos TaskPoint, una metodología de simulación muestreada para programas basados en tareas. Los modelos de programación basados en tareas pueden reducir los costes de sincronización de programas paralelos ejecutados en sistemas multi-core y actualmente están ganando importancia. Finalmente, presentamos MUSA, una metodología para simular aplicaciones ejecutadas en miles de núcleos de un sistema híbrido, compuesto de nodos de memoria compartida que forman un sistema de memoria distribuida. El tiempo de simulación que requieren las simulaciones con MUSA es comparable con el tiempo necesario para la ejecución del programa simulado en un sistema de alto rendimiento en producción. Las técnicas desarolladas al largo de esta tesis permiten a los investigadores e ingenieros trabajando en la arquitectura de computadores simular ejecuciones largas, que antes no se podían simular. Nuestro trabajo facilita nuevos caminos de investigación en los campos de sistemas de memoria compartida o distribuida y en sistemas híbridos.
Brito, Andrey. "Speculation in Parallel and Distributed Event Processing Systems." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2010. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-38911.
Повний текст джерелаSreenivasan, C. R. "Task Scheduling Technlques for Distrlbuted/Parallel Processing Systems." Thesis, Indian Institute of Science, 1993. http://hdl.handle.net/2005/45.
Повний текст джерелаThis dissertation discusses the principles, techniques and approaches adopted in the design of task scheduling algorithms for Distributed Parallel Processing Computer Systems (DPCSs) connected with network of front-end systems (FSs), The primary goal in the design of scheduling algorithms is to minimise the total turnaround time of the jobs to be scheduled by maximizing the utilisation of the resources of the DPCS with minimum data communication overhead, The users present their jobs to be scheduled at the FS, The FS receives a job and generates a finite set of independent tasks based on mutually independent sections having inherent parallelism, Each task could be scheduled to different available processors of DPCS for concurrent execution, The tasks are of three groups viz,, compute intensive tasks, input. output intensive tasks and the combination of compute and input-output intensive tasks. They may have the execution time almost the same. Some of the tasks may have the execution time larger due to precedence constraints than that of other tasks and they are provided with logical breakpoints which can be utilised to further break the tasks into subtasks during scheduling, The technique of using breakpoint of the tasks is more appropriate when the number of available processors is more than the number of tasks to be scheduled. The tasks of a job thus generated are sent to the front-end processor (FEP or the host processor) of the DPCS in the form of data flow graph (DFG), The DFG is used to model the tasks and represent the precedence (or data dependencies) among the tasks, In order to preserve the constraints among the tasks during scheduling and realise efficient utilisation of the resources of DPCS, the DFG is structured in the form of levels, The FBP of DPCS has a resident Task Manager (TM). The key function of the TM is to schedule the tasks to the appropriate processors of DPCS either statically or dynamically based on the required resources. To realise efficient scheduling and utilisation of the processors of DPCS, the TM uses a set of buffers known as Task Forwarding Buffer (TFB), Task Output Buffer (TOB) and Task Status Buffer (TSB) maintained by the FEP of DPCS. The tasks of a job from the FS are received at the TFB. The TM picks up a set of tasks pertaining to a level for scheduling into a temporary buffer C and obtains the status of the processors of DPCS. In order to realise both static and dynamic approaches of allocation, task to processor relation is considered in the scheduling algorithm. If the number of tasks in C is equal to or greater than the number of processors available, one task per processor is allocated, the remaining tasks of C are scheduled subsequently as and when the processors become available. This method of allocation is called static approach. If the number of tasks in C is less than the number of processors available, the TM makes use of the logical breakpoints of the tasks to generate subtasks equal to the number of available processors. Each subtask is scheduled to a processor. This method of scheduling is called the dynamic approach. In all the case the precedence constraints among the tasks are preserved by scheduling the successor task to the parent processor or near neighbouring processor, maintaining minimum data communication between them. Various examples of Computational Fluid Dynamics problems' were tested and the objective of reduced total turnaround time and maximum utilisation of the processors was achieved. The total turnaround time achieved for different jobs varies between 51% and 86% with static approach and 16% and 89% with dynamic approach. The utilisation of the processors varies between the 50% and 92.5%. Hence a speed-up of 5 to 8 folds is realised.
Friedrich, Markus [Verfasser]. "Parallel Co-Simulation for Mechatronic Systems / Markus Friedrich." München : Verlag Dr. Hut, 2012. http://d-nb.info/1021072753/34.
Повний текст джерела