As ITS technology evolves, very large volume of traffic data can be obtained in real-time. Traffic data are continuously produced and they can be considered as a kind of stream data. Currently, such traffic data are n...
详细信息
ISBN:
(纸本)9780769531328
As ITS technology evolves, very large volume of traffic data can be obtained in real-time. Traffic data are continuously produced and they can be considered as a kind of stream data. Currently, such traffic data are not maintained permanently because of the storage limitations of operational systems. Therefore, it was impossible to compare temporal historical patterns over long time periods. In this paper, we propose a traffic data management scheme, which can handle historical data as well as current data. The proposed scheme is based on the GALIS architecture, which is a cluster-based distributedcomputing system architecture that consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone. Some experimental results showing performance factors are also explained.
Many real-time systems use preemptive priority-based scheduling in their internals to guarantee certain real-time performance. This includes technologies that range from The real-time Specification for Java (RTSJ) to ...
详细信息
Many real-time systems use preemptive priority-based scheduling in their internals to guarantee certain real-time performance. This includes technologies that range from The real-time Specification for Java (RTSJ) to middleware like real-time Common object Request Broker Architecture (RT-CORBA), which offers additional models and policies that blend client and server information. This decision eases the integration of real-time admission tests and dispatching policies in these types of infrastructures. In this paper, we analyze different trade-offs that emerge from the definition of different propagation models for distributedreal-time Java. The paper covers technological integration aspects as impact on interfaces and other practical issues mainly related to the performance that this model offers to a real-time application and non-functional overhead. The contribution described in the paper may help in the development of The distributed Specification for Java (DRTSJ). Copyright (C) 2011 John Wiley & Sons, Ltd.
System execution traces are useful artifacts for validating distributed system quality-of-service (QoS) properties, such as end-to-end response time, throughput, and service time. With proper planning during developme...
详细信息
This paper presents the design of HIDOORS, an integrated development environment suitable for embedded distributedreal-time systems, based on the Java programming language. HIDOORS will cover all the life-cycle of re...
详细信息
ISBN:
(纸本)0769515762
This paper presents the design of HIDOORS, an integrated development environment suitable for embedded distributedreal-time systems, based on the Java programming language. HIDOORS will cover all the life-cycle of real-time software development with extensions to existing tools (UML modeling, Java compiler, Java Virtual Machine, and a worst case execution time analysis tool) that will all be integrated into a single integrated development environment. The system will also assist the developer in distributing the application, by, providing faster RMI and a distributed event manager that provides strict timing guarantees. This paper is written at the beginning of HIDOORS development, and as such, it presents only the defined objectives and the early, architecture of the system;further developments will be the subject of future works.
In this work we present a novel architecture for distributedcomputing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web computing Library (PUBWCL), which was formerly used as...
详细信息
ISBN:
(纸本)0769526977
In this work we present a novel architecture for distributedcomputing in a peer-to-peer network. In particular, we realize the Paderborn University BSP-based Web computing Library (PUBWCL), which was formerly used as a centralized client-server architecture for scheduling and load balancing, as a pure peer-to-peer system. By using distributed heterogeneous hash tables (DHHT), our architecture-features scheduling and load balancing of tightly coupled, massively parallel algorithms in the bulk-synchronous (BSP) style with a minimal number of migrations. Furthermore, our architecture is capable of heterogeneous BSP programs whereas the former version of PUBWCL could only handle homogeneous BSP programs.
This paper presents our experiments for integrating OMG MIOP (Mullicast Inter-ORB Protocol) specifications into a CORBA ORB. We proposed an integration model which allows the coexistence of two different protocol stac...
详细信息
Large distributed systems may contain millions of objects that have to be managed. This makes it impossible to specify management policies for individual objects. Instead it is necessary to specify policy for groups o...
详细信息
This paper describes an object-orienteddistributed control environment for industrial multirobot applications. A distributedcomputing environment, where workpieces, robots, and other industrial devices such as a vis...
详细信息
This paper describes an object-orienteddistributed control environment for industrial multirobot applications. A distributedcomputing environment, where workpieces, robots, and other industrial devices such as a vision sensor are defined as software objects with class inheritance hierarchy, supports human-friendly task-level programming and automated robot program generation with 3D graphic simulation, and performs supervisory and real-time sensor-based coordinated control of multirobot systems. Using object-oriented multitasking control with a preemptive rescheduler, vision-based robot positioning and pick and place operations for exchange of a workpiece are demonstrated to validate the control performance of the computing environment. (C) 1999 Elsevier Science B.V. All rights reserved.
A transactional agent is a mobile agent to manipulate objects distributed on computers with some type of commitment condition. For example, a transactional agent commits only if at least one object could be successful...
详细信息
ISBN:
(纸本)076952561X
A transactional agent is a mobile agent to manipulate objects distributed on computers with some type of commitment condition. For example, a transactional agent commits only if at least one object could be successfully manipulated in the at-least-one commitment condition. Computers may stop by fault while networks are assumed to be reliable. In the client-server model, servers can be fault-tolerant according to traditional replication and checkpointing technologies. However, an application program cannot be performed if a client computer is faulty An application program can be performed on another operational computer even if a computer is faulty in the transactional agent model. For example, a transactional agent can move to another operational computer if some destination computer where the agent to move is faulty There are kinds of faulty computers for a transactional agent, current, destination, and sibling computers where a transactional agent now exist, will move, and has visited, respectively. We discuss how the transactinal agent can be tolerant of the types of faults. We show how a program reliably manipulating objects can be realized in a mobile agent in presence of computer faults.
This paper addresses the problem of measuring time in object-oriented event-driven real-time systems. Several possible implementations of the timing subsystem are considered. Some important consequences that an implem...
详细信息
ISBN:
(纸本)3540643591
This paper addresses the problem of measuring time in object-oriented event-driven real-time systems. Several possible implementations of the timing subsystem are considered. Some important consequences that an implementation can have on the overall time overhead are discussed. The paper proposes a modified multiple-rate policy of updating software timers. Timing ticks are distributed through a tree structure in a way that tends to minimize the overall overhead, while retaining a small variation of the overhead in different clock cycles. The paper presents the results of a comparative analysis of the described models. The analysis considers different exploitation conditions, in respect to the number of software timers and their resolutions.
暂无评论