Internet and Grid based systems, whether their purpose is computation, collaboration and information sharing, are all instances of systems based on application of fundamental principles of distributed computing. This ...
详细信息
ISBN:
(纸本)078038430X
Internet and Grid based systems, whether their purpose is computation, collaboration and information sharing, are all instances of systems based on application of fundamental principles of distributed computing. This paper reports on a graduate seminar on Internet and Grid computing which focuses on the fundamental principles and concepts of distributed computation which underlie Internet and Grid systems, both software and applications. The course takes a broad definition of Internet and Grid computing, ranging across high performance computation to peer-to-peer file sharing systems. The focus is on identification and analysis of the concepts and principles underlying grid computing and how they are realized and applied in systems ranging from Globus to Freenet with web services in between. In summary, the course is a "what is it" rather than a "how to do it." Each participant does a project concerning an Internet or Grid computing subject and presents it to the class.
Ubiquitous and Wearable computing both have the goal of pushing the computer into the background, supporting all kinds of human activities. Application areas include areas such as everyday environments (e.g. clothing,...
详细信息
The proceedings contain 45 papers from the acm MSWiM 2004 - proceedings of the Seventh acmsymposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems. The topics discussed include: rapid and energy ...
详细信息
ISBN:
(纸本)1581139535
The proceedings contain 45 papers from the acm MSWiM 2004 - proceedings of the Seventh acmsymposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems. The topics discussed include: rapid and energy efficient neighbor discovery for spontaneous networks;channel-quality dependent earliest deadline due fair scheduling schemes for wireless multimedia networks;an optimal packet scheduling and load balancing algorithm for LEO/MEO satellite networks;detailed models for sensor network simulations and their impact on network performance;and a generic approach for including live measurements and traffic forecasts in the generation of realistic traffic scenarios in mobile radio networks.
Many lock-free data structures in the literature exploit techniques that are possible only because state-of-the-art 64-bit processors are still running 32-bit operating systems and applications. As software catches up...
详细信息
ISBN:
(纸本)9781581138023
Many lock-free data structures in the literature exploit techniques that are possible only because state-of-the-art 64-bit processors are still running 32-bit operating systems and applications. As software catches up to hardware, "64-bit-clean" lock-free data structures, which cannot use such techniques, are needed. We present several 64-bit-clean lock-free implementations: load-linked/store-conditional variables of arbitrary size, a FIFO queue, and a freelist. In addition to being portable to 64-bit software, our implementations also improve on previous ones in that they are space-adaptive and do not require knowledge of the number of threads that will access them.
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q Ε P are joined by an edge if the segment pq ⊂ Q. Efficient output-sensitive algorithms are kno...
详细信息
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q Ε P are joined by an edge if the segment pq ⊂ Q. Efficient output-sensitive algorithms are known for the case in which P is the set of all vertices of Q. We examine the general case in which P is an arbitrary set of points, interior or on the boundary of Q and study a variety of algorithmic questions. We give an output-sensitive algorithm, which is nearly optimal, when Q is a simple polygon. We introduce a notion of "fat" or "robust" visibility, and give a nearly optimal algorithm for computing visibility graphs according to it, in polygons Q that may have holes. Other results include an algorithm to detect if there are any visible pairs among P, and algorithms for output-sensitive computation of visibility graphs with distance restrictions, invisibility graphs, and rectangle visibility graphs.
Networks of the future will be characterized by a variety of computational devices that display a level of dynamism not seen in traditional wired networks. Because of the dynamic nature of these networks, resource dis...
详细信息
Networks of the future will be characterized by a variety of computational devices that display a level of dynamism not seen in traditional wired networks. Because of the dynamic nature of these networks, resource discovery is one of the fundamental problems that must be solved. While resource discovery systems are not a novel concept, securing these systems in an efficient and scalable way is challenging. This paper describes the design and implementation of an architecture for access-controlled resource discovery. This system achieves this goal by integrating access control with the Intentional Naming System (INS), a resource discovery and service location system. The integration is scalable, efficient, and fits well within a proxy-based security framework designed for dynamic networks. We provide performance experiments that show how our solution outperforms existing schemes. The result is a system that provides secure, access-controlled resource discovery that can scale to large numbers of resources and users. Copyright (C) 2004 John Wiley Sons, Ltd.
XML and its associated languages are emerging as powerful authoring tools for multimedia and hypermedia web content. Furthermore, intelligent presentation generation engines have begun to appear, as have models and pl...
详细信息
ISBN:
(纸本)1581139381
XML and its associated languages are emerging as powerful authoring tools for multimedia and hypermedia web content. Furthermore, intelligent presentation generation engines have begun to appear, as have models and platforms for adaptive presentations. However, XML-based models are limited by their lack of expressiveness in presentation and animation. As a result, authors of dynamic, adaptive web content must often use considerable amounts of script or code. The use of such script or code has two serious drawbacks. First, such code undermines the declarative description possible in the original presentation language, and second, the scripting/coding approach does not readily lend itself to authoring by non-programmers. In this paper we describe a set of XML language extensions, inspired by features from the functional programming world, which are designed to widen the class of reactive systems which could be described in languages such as SMIL. The described features extend the power of declarative modeling for the web by allowing the introduction of web media items which may dynamically react to continuously varying inputs, both in a continuous way and by triggering discrete, user-defined, events. The two extensions described herein are discussed in the context of SMIL Animation and SVG, but could be applied to many XML-based languages.
Program generation is among the most promising techniques in the effort to increase the automation of programming tasks. In this paper, we discuss the potential impact and research value of program generation, we give...
详细信息
ISBN:
(纸本)9781581138351
Program generation is among the most promising techniques in the effort to increase the automation of programming tasks. In this paper, we discuss the potential impact and research value of program generation, we give examples of our research in the area, and we outline a future work direction that we consider most interesting. Specifically, we first discuss why program generators have significant applied potential. At the same time we argue that, as a research topic, meta-programming tools (i.e., language tools for writing program generators) may be of greater value. We then illustrate our views on generators and meta-programming tools with our latest work on the Meta-AspectJ meta-programming language and the GOTECH generator. Finally, we examine the problem of statically determining the safety of a generator and present its intricacies. We limit our focus to one particular kind of guarantee for generated code - ensuring that the generated program is free of compile-time errors. We believe that this research direction will see significant attention and will make a difference in the mainstream adoption of meta-programming technology.
A detailed power analysis of a multi-radio mobile platform highlights the complex tradeoffs between the computation, storage, and communication subsystems. The particular mobile device, which does not include an LCD o...
详细信息
Quantitative techniques for visualization are critical to the successful analysis of both acquired and simulated scientific data. Many visualization techniques rely on indirect mappings, such as transfer functions, to...
详细信息
暂无评论