{"title":"COMA-BC: a cache only memory architecture multicomputer for non-hierarchical common bus networks","authors":"B. S. Fernández, J. A. I. Arenas","doi":"10.1109/EMPDP.1998.647239","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647239","url":null,"abstract":"The use of multicomputer systems as opposed to multiprocessors allows one to build machines with good performance quality through the use of computers connected to general purpose networks. This type of system is more flexible, cheaper and its use is very common. However, multicomputer systems are based on message passing as a programming paradigm, which makes the programming, to a large degree, more difficult. The authors propose a multicomputer system, COMA-BC, based on a bus type interconnection network governed by hardware coherence. Such a system provides a programming model with shared, dynamic variable types in which the data migrates to those nodes that need it. The implementation of the abstraction of a space with shared addresses in a physically distributed substratum of memory is carried out through a snoopy type coherence protocol in which directory information has been used to reduce the traffic in the interconnection network. They have carried out an efficiency study for the execution of applications of the set SPLASH-2, based on the construction of an emulator in a multicomputer environment.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122073189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. J. Suárez, Javier García, J. Entrialgo, D. García, S. Graffa, P. Miguel
{"title":"A toolset for visualization and analysis of parallel real-time embedded systems based on fast prototyping techniques","authors":"F. J. Suárez, Javier García, J. Entrialgo, D. García, S. Graffa, P. Miguel","doi":"10.1109/EMPDP.1998.647197","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647197","url":null,"abstract":"This paper describes a toolset, whose objective is to provide full support for the analysis and testing of temporal behavior in the development of parallel realtime systems. The development approach supported by the toolset is based on an incremental prototyping technique combined with successive analyses and tests of the temporal behavior of prototypes carried out along the development cycle. The toolset is composed of three main tools: a prototyper, a monitor and visualizer/analyzer. Most current monitoring and analysis tools are oriented to measure and visualize the behavior of software entities (mainly processes) and the utilization of hardware resources, that is, the elements of the system design. In addition to this, this toolset incorporates a graph based model that provides a functional view of the behavior. This is expressed in terms of the sequences of activities executed by the system in response to the main external environment events (reactive aspect of real-time systems). Moreover, the toolset provides a powerful means to design and test the system under development in an incremental manner.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"103 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114544383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed computation in a three-dimensional mesh with communication delays","authors":"W. Glazek","doi":"10.1109/EMPDP.1998.647177","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647177","url":null,"abstract":"We study the problem of scheduling a divisible load in a three-dimensional mesh network in which processors communicate by means of circuit-switched routing. The objective is to find a distribution of load shares among processors which minimizes the processing time for a given computation volume. We model and solve the problem with a set of algebraic equations. Whereas other algorithms distribute all data in a single sweep, our load distribution algorithm scatters data in a sequence of sweeps, each sweep brings data to a set of processors located in the same distance from the source of the distribution. The second feature which distinguishes our algorithm is that processors start computation in the reverse order their distance from the originator as opposed to previous solutions in which processors begin computation in the order of that distance. We evaluate the performance of our algorithm and show that it improves on previous results obtained for mesh networks.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126888523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Rolt/sup MP/-replay of Lamport timestamps for message passing systems","authors":"Michiel Ronsse, D. Kranzlmüller","doi":"10.1109/EMPDP.1998.647184","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647184","url":null,"abstract":"Debugging nondeterministic parallel programs is rather difficult, because consecutive runs with the same input data may result in different executions. To overcome these problems for cyclic debugging, replay mechanisms based on trace driven simulation have been developed. As replay is based on a previously monitored program run, the overhead generated by the monitoring functionality is rather critical. It has to be small enough in order to keep the intrusion on the program as low as possible. An example of such a replay mechanism with low intrusion is the ROLT method, which was originally developed for shared memory systems. This method uses Lamport clocks to trace the order of accesses to shared objects. Although processes in message passing systems interact completely different, some ideas of ROLT are useful and can be ported to the distributed memory area. As a result an improved monitoring and replay approach with a lower overhead compared to other existing methods can be implemented.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127519141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
D. Crookes, Judy Brown, I. Spence, P. Morrow, D. Roantree, G. McAleese
{"title":"An efficient, portable software platform for parallel image processing","authors":"D. Crookes, Judy Brown, I. Spence, P. Morrow, D. Roantree, G. McAleese","doi":"10.1109/EMPDP.1998.647204","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647204","url":null,"abstract":"A software development environment for image processing is described, which has as one of its aims to achieve portability and efficiency over a range of parallel architectures. The environment includes several tools, one of which is an optimiser which automatically generates very efficient code from a high level user coding. The first time the program is run, it does so rather inefficiently. But after an off-line optimisation phase, the same program can be rerun with significant performance improvements. Timings to date indicate a speed-up of around 5 can be achieved in the computation parts of a typical program.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125323451","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A special-purpose parallel computer for solving partial differential equations","authors":"L. Piñuel, I. Llorente, F. Tirado","doi":"10.1109/EMPDP.1998.647240","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647240","url":null,"abstract":"The paper describes a special-purpose single instruction multiple data (SIMD) computer that implements multigrid algorithms for solving partial differential equations. The authors show that the multigrid machine is a very good alternative to commercial microprocessor-based parallel computers for solving partial differential equations, which is one of the most demanding applications. The computer obtains a very good performance/cost ratio by way of the exploitation of the innate properties in multigrid algorithms and the advantages of the massive parallelism. Moreover, it does not suffer from the problem of most special-purpose computers, i.e. the need to use a specific programming language. The computer can be programmed, from the higher abstraction level, by using an environment that automatically generates multigrid code from a problem specification. They consider this work as a first step in the building a prototype of the architecture with field programmable gate arrays (FPGAs).","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132815990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dataflow parallel database systems and LOGFLOW","authors":"P. Kacsuk, N. Podhorszki","doi":"10.1109/EMPDP.1998.647223","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647223","url":null,"abstract":"LOGFLOW is a distributed Prolog system running on multi transputer machines and workstation clusters. It is based on the dataflow principle. The most recent database management systems prefer shared nothing architectures and dataflow execution mechanism because of their promising features. LOGFLOW is examined from the database point of view. Both relational and deductive DBMSs can be parallelized by the use of the parallel engine of LOGFLOW.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132847094","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Virtual networks and QoS for cluster computing","authors":"C. Allision","doi":"10.1109/EMPDP.1998.647189","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647189","url":null,"abstract":"Exploiting clusters of workstations as a single computational resource is an attractive alternative to conventional multiprocessor technologies. However, the class of parallel applications that can benefit from clusters is restricted due to their relatively high latency and low throughput-consequences of conventional networking. LANs offer the best performance but also limit the scope for effective clustering to a single room or building. Another major difference remains: multiprocessors can reasonably be programmed with the \"error-free\" assumption but applications cannot be run on distributed clusters without programming against the potential for remote faults. Emergent high speed switched networks such as ATM have the potential to reduce latency and increase bandwidth in the distributed scenario, and therefore extend the class of applications suitable for running on clusters. In addition, the virtual network capability of ATM removes some of the geographical constraints from clustering. But can ATM guarantee the type of application-level connection reliability which is taken for granted in multiprocessor environments? This paper reviews the capabilities of modern high-speed networks as exemplified by ATM and their relevance to parallel and distributed systems. In particular it asks if Quality of Service (QoS) can benefit parallel programming on distributed platforms.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130617318","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Antonio Polo Márquez, J. C. Manzano, Miryam Salas Sánchez, Marisol Sánchez, E. Jurado, M. B. García, J. Núñez, Juan-Miguel Martínez
{"title":"Multiattribute indexing with m-Q-trees","authors":"Antonio Polo Márquez, J. C. Manzano, Miryam Salas Sánchez, Marisol Sánchez, E. Jurado, M. B. García, J. Núñez, Juan-Miguel Martínez","doi":"10.1109/EMPDP.1998.647185","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647185","url":null,"abstract":"A wide class of multidimensional indexes employs a recursive partitioning of the data space as the kd-tree does. In this paper we present the m-Q-tree as a multidimensional data structure that can achieve the maximum degree of 2/sup m/ children in every node (where m is the number of index attributes) and a maximum of only one underflow page per node. We describe the m-Q-tree, and give searching and inserting algorithms. In order to develop a solution for building the m-Q-tree we define and use a conceptual tool, called prefix graph, which permits us to manage the regions associated to all sons of every node. The proposed algorithm is of order O(m). Finally, we present the results of a series of tests which indicate that the structure preforms well. m-Q-tree gives a general technique for declustering data in a parallel database. We propose m-Q-tree as a new general access method which permits the exploitation of the potential parallelism of all relational operations, in addition to favour the execution of complex queries, including different kinds of conditions over several attributes fro one or more relations.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114139729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Tool to evaluate performance in distributed heterogeneous processing","authors":"J. Mccann, K. Manning","doi":"10.1109/EMPDP.1998.647196","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647196","url":null,"abstract":"The next generation computing architectures will consist of a fusion of heterogeneous systems interoperating. This concept is gaining popularity yet there are currently few tools available for performance visualisation and management of heterogeneous interoperating systems using middleware. This paper looks at the design of middleware performance tools, using our current project as an example, focusing on information systems processing. We discuss the issues such as performance metrics (obtained from a user market study), raw performance data extraction, its analysis, and finally performance presentation and visualisation.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125065154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}