{"title":"Multi-lingual threading","authors":"A. Kind, J. Padget","doi":"10.1109/EMPDP.1998.647230","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647230","url":null,"abstract":"Multiple threads of execution within a single address space provide concurrency in a structured and simple way. The paper describes how threads can cross language boundaries, i.e. can be shared by components written in different languages within a single application (multilingual threading). The advantage is that each component can be written in the language which is most suitable for it and benefit from multithreading. Our approach to multilingual threading is implemented in youtoo. The youtoo system supports the creation of multithreaded stand alone applications from interlinked EuLisp and C modules. Depending on the platform, multithreading is based on the POSIX kindred UI (UNIX International), PPCR (POSIX Portable Common Runtime) or MIT thread library. We show that multilingual threading is particularly fruitful when higher level and lower level languages, like Lisp and C, are combined.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"37 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":"126097856","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}
Andreas Böhm, Wolfgang Oberndorfer, R. Schmitz, S. Uellner
{"title":"Teleseminars via ISDN technical set-up and user reactions","authors":"Andreas Böhm, Wolfgang Oberndorfer, R. Schmitz, S. Uellner","doi":"10.1109/EMPDP.1998.647202","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647202","url":null,"abstract":"One major application of IP- or ISDN based videoconferencing tools is telelearning or teleteaching. Of special importance in the context is the audio-visual quality of the transmission. The aim of the paper is to evaluate if the existing technology using narrowband ISDN is mature enough to guarantee a sufficient quality of the transmission. To this end several seminars were disseminated by ISDN based videoconferencing tools. In order to investigate the user experiences, questionnaires were distributed among the participants. Based on these questionnaires, valuable insights into the user perception of the audio and video signal of such transmissions and on the usefulness of the tools investigated were gained.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"203 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":"123518405","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}
K. Sandkuhl, Lutz Nentwig, S. Manhart, Petra Lafrenz
{"title":"Redesigning CSCW-systems for network computing-experience from the HotCon project","authors":"K. Sandkuhl, Lutz Nentwig, S. Manhart, Petra Lafrenz","doi":"10.1109/EMPDP.1998.647215","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647215","url":null,"abstract":"The emphasis in CSCW research is currently shifting towards the integration of different existing tools into comprehensive CSCW systems and the interoperation of proprietary CSCW systems. A suitable basis for this integration is provided by concepts from network computing. Comprehensive integration can be achieved by means of the standardisation of components which are to be offered in a totally networked global computer environment. This can cut costs considerably due to the resulting high degree of reusability and opens up the possibility of developing a new quality of distributed systems. Most of today's CSCW systems are constructed according to the traditional client/server paradigm. The migration of these systems towards network computing usually requires a redesign of their architecture. Key features of application architectures for network computing and possibilities to migrate existing software are discussed. The reported experience is based on the HotCon system, a hotline and consulting environment developed at the Fraunhofer ISST.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"35 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":"126506502","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":"Solving sparse triangular systems on distributed memory multicomputers","authors":"Patricia González, J. C. Cabaleiro, T. F. Pena","doi":"10.1109/EMPDP.1998.647235","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647235","url":null,"abstract":"The authors describe and compare two different methods for solving sparse triangular systems in distributed memory multiprocessor architectures. The two methods involve some preprocessing overheads so they are primarily of interest in solving many systems with the same coefficient-matrix. Both algorithms start off from the idea of the classical substitution method. The first algorithm presented introduces a concept of data driven flow, and makes use of non-blocking communications in order to dynamically extract the inherent parallelism of sparse systems. The second algorithm uses a reordering technique for the unknowns, so the final system can be grouped in variable block sizes where the rows are independent and can be solved in parallel. This latter technique is called level scheduling because of the way it is represented in the adjacency graph.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"16 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":"126320994","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":"Open and reliable group communication processing: the FITOS-RPC approach","authors":"L. Barreto, Ingrid Jansch-Pôrto","doi":"10.1109/EMPDP.1998.647224","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647224","url":null,"abstract":"The paper describes the design of a fault tolerant group remote procedure call system based on the ISO RPC international standard ISO/IEC 11578. The system extends the original model providing detection and handling of orphan computations caused by process crashes or network partitioning. A group communication protocol supports replicated procedure execution preserving total message ordering among nodes. An X.500 directory service is also used to provide transparent service location.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"5 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":"131932693","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":"LogP performance characterization of fast messages atop Myrinet","authors":"G. Iannello, Mario Lauria, Stefano Mercolino","doi":"10.1109/EMPDP.1998.647225","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647225","url":null,"abstract":"The Fast Messages (FM) project is a highly optimized, low latency messaging layer providing a virtual interface to the communication hardware. The purpose of the paper is to present a detailed characterization of the FM communication messaging layer using the LogP model. We have used a series of communication microbenchmarks to measure the parameters of the LogP model. These specialized benchmarks are similar to those employed by D.E. Culler et al. (1996) to characterize the network interfaces of different parallel machines. The main focus of our analysis is the interaction between the messaging layer and the underlying communication system. We show that LogP can be a useful architectural analysis tool, providing the designer with some additional insight into the way different parts of the communication subsystem interact and contribute to the total communication overhead.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"58 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":"116266680","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":"Effective usage of vector registers in decoupled vector architectures","authors":"L. Villa, R. Espasa, M. Valero","doi":"10.1109/EMPDP.1998.647238","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647238","url":null,"abstract":"The paper presents a study of the impact of reducing the vector register size in a decoupled vector architecture. In traditional in-order vector architectures long vector registers have typically been the norm. The authors present data which shows that, even for highly vectorizable codes, only a small fraction of all elements of a long vector register are actually used. They also show that reducing the register size in a traditional vector architecture in an attempt to reduce hardware cost and maximize register utilization results in a severe performance degradation. However they combine the decoupling technique with the vector register reduction and show that the resulting architecture tolerates very well the register size cuts. They simulate a selection of Perfect Club and Specfp92 programs using a trace driven approach and compare the execution time in a conventional vector architecture with a decoupled vector architecture using different registers sizes. Halving the register size and using decoupling provides speedups between 1.04-1.49 over a traditional in-order vector machines. Even reducing the register length to 1/4 the original size (and in some cases, to 1/8) the performance of the decoupled machine is better than a conventional vector model. Moreover they observe that the resulting decoupled machine with short registers tolerates very well long memory latencies.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"41 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":"123271582","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 safe distributed deadlock resolution algorithm for the OR request model","authors":"J. Villadangos, F. Fariña, J. R. G. D. Mendívil","doi":"10.1109/EMPDP.1998.647192","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647192","url":null,"abstract":"This paper presents an algorithm for resolving OR deadlocks in distributed systems. The algorithm works in two concurrent phases. Firstly, it collects the paths of the WFG (at each initiator process). A termination detection mechanism is used to know the ending of this phase. Collected paths are then analyzed to discover whether the process belongs to a deadlock. The proposed algorithm has two primary advantages. First, it assures that only true deadlocks are detected. Second, since only one process detects each deadlock, it simplifies the task of deadlock resolution. The algorithm resolves all deadlocks with a communication cost of O(2e) messages in the worst case (being e the number of wait-for relations between nodes of the knot), so their complexity is also better than or equal to the existing algorithms.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"36 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":"121377303","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}
Jonathan M. D. Hill, S. Jarvis, Constantinos J. Siniolakis, V. P. Vasilev
{"title":"Portable and architecture independent parallel performance tuning using a call-graph profiling tool","authors":"Jonathan M. D. Hill, S. Jarvis, Constantinos J. Siniolakis, V. P. Vasilev","doi":"10.1109/EMPDP.1998.647211","DOIUrl":"https://doi.org/10.1109/EMPDP.1998.647211","url":null,"abstract":"The paper describes a post mortem call graph profiling tool that analyses trace information generated during the execution of BSPlib programs. The purpose of the tool is to expose imbalance in either computation or communication, and to highlight portions of code that are amenable to improvement. Unlike other profiling tools, the profile information guides optimisation in an architecture independent way. From an ease of use perspective, the amount of information displayed when visualising a profile for a parallel program is no more complex than that of a sequential program.","PeriodicalId":265140,"journal":{"name":"Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130826729","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}