Information systems based on the World Wide Web increased the impact of concurrent programs. Such increase demands the definition of methods for obtaining safe and efficient implementations of concurrent programs, sin...
详细信息
ISBN:
(纸本)1595934804;9781595934802
Information systems based on the World Wide Web increased the impact of concurrent programs. Such increase demands the definition of methods for obtaining safe and efficient implementations of concurrent programs, since the complexity of implementation and tests in concurrent environments is bigger than in sequential environments. This work defined guidelines to restructure object-oriented software in order to modularize concurrency control using aspect-oriented programming. Those guidelines are supported by a concurrency control implementation that guarantees system correctness without redundant concurrency control, both increasing performance and guaranteeing safety. We define abstract aspects that constitute a simple aspect framework that can be reused to implement concurrency control in other applications. The achieved modularization makes the concurrency control easy to evolve and decreases the complexity of other parts of the software, such as business and data management modules, by decoupling concurrency control code from them. Copyright 2007 acm.
The representation and execution of business processes have generated some important challenges in Computer Science. An important related concern is the choosing of the best formal foundation to specify processes beha...
详细信息
ISBN:
(纸本)1595934804;9781595934802
The representation and execution of business processes have generated some important challenges in Computer Science. An important related concern is the choosing of the best formal foundation to specify processes behavior, mainly representing control-flow patterns in cooperative environments. The first contribution of this research is the complete definition of the Navigation Plan Definition Language (NPDL) as an alternative for business process managing in cooperative environments. The second contribution is a complete implementation of control-flow patterns using NPDL. These control-flow patterns have been proposed by Aalst's group. Our experience in applying suggestion of Aalst's group to use control-flow patterns as a basis for comparison among control-flow specification languages shows that this comparison method is feasible and the results are useful. The simplicity of NPDL representations shows the advantages of NPDL as a process specification language. NPDL uses a declarative specification (similar to process algebra) to describe the workflow and adds new operators to compensate for the limitations of process algebra and Petri nets. NPDL also increases the modeling flexibility by allowing the reuse of process expressions in relational data-base systems. Copyright 2007 acm.
Developing widely useful mobile computing applications presents difficult challenges. On one hand, mobile users demand intuitive user interfaces, fast response times, and deep relevant content. On the other hand, mobi...
详细信息
ISBN:
(纸本)1595934804;9781595934802
Developing widely useful mobile computing applications presents difficult challenges. On one hand, mobile users demand intuitive user interfaces, fast response times, and deep relevant content. On the other hand, mobile devices have limited processing, storage, power, display, and communication resources. Caching frequently accessed data items on the mobile client is an effective technique to improve the system performance in mobile environment. Due to cache size limitation, the choice of cache replacement technique to find a suitable subset of items for eviction from cache becomes important. In this paper, we propose a new cache replacement policy for location dependent data in mobile environment. The proposed policy selects the predicted region based on client's movement and uses it to calculate the weighted data distance of an item. This makes the policy adaptive to client's movement pattern and provides importance to the regions around client's position. This is unlike earlier policies that consider the directional/non-directional data distance only. We call our policy the Weighted Predicted Region based Cache Replacement Policy (WPRRP). Simulation results show that the proposed policy significantly improves the system performance in comparison to previous schemes in terms of cache hit ratio. Copyright 2007 acm.
Component based software engineering has been claimed as a suitable approach to improve the flexibility and reuse in software development. In this context, the Compor infrastructure provides mechanisms to promote the ...
详细信息
ISBN:
(纸本)1595934804;9781595934802
Component based software engineering has been claimed as a suitable approach to improve the flexibility and reuse in software development. In this context, the Compor infrastructure provides mechanisms to promote the dynamic composition of software systems, addressing applications with support for unanticipated requirement changes. In this paper, the formal modelling and verification of the COMPOR component model is presented. Hierarchical Colored Petri Nets are used for modelling and simulation, purposing to show the correct behavior for some scenarios. Model checking is used to prove that the scenarios analyzed with simulation are correct for all possible behaviors of the model. Copyright 2007 acm.
Mobile computing allows for the development of new and sophisticated database applications. Such applications require the reading of current and consistent data. In order to improve data availability, increase perform...
详细信息
ISBN:
(纸本)1595934804
Mobile computing allows for the development of new and sophisticated database applications. Such applications require the reading of current and consistent data. In order to improve data availability, increase performance and maximize throughput, data replication is used. However, due to inherent limitations in mobile and other loosely-coupled environments, the concurrency control and replica control mechanisms must be revisited. This paper proposes a new protocol that guarantees the consistency of replicated data in a mobile computing environment, while provide high data availability and ensure an eventual replica convergence towards a strongly consistent state. Copyright 2007 acm.
Implementation of differentiated Quality-of-Service (QoS) in next-generation computer networks has received increasing research interests from both academia and industry. The Generalized Processor Sharing (GPS) schedu...
详细信息
ISBN:
(纸本)1595934804;9781595934802
Implementation of differentiated Quality-of-Service (QoS) in next-generation computer networks has received increasing research interests from both academia and industry. The Generalized Processor Sharing (GPS) scheduling strategy has been widely studied as a promising way to provide differentiated QoS due to its service protection feature. Most of the previous studies reported in the literature, however, have focused on the analysis of GPS under either Short Range Dependent (SRD) or Long Range Dependent (LRD) traffic only, neither of which is able to capture the heterogeneous properties of realistic traffic in multi-service networks solely. To fill this gap, this paper develops a new analytical performance model for GPS systems subject to both LRD self-similar traffic and SRD Poisson traffic. More specifically, using an approach based on Large Deviation Principles, this study contributes to performance modelling and evaluation of GPS scheduling by deriving the analytical upper and lower bounds of the aggregate and individual queue length distributions of heterogeneous traffic flows. The comparisons between analytical bounds and extensive simulation results validate the accuracy and merits of the analytical model which can be adopted as a practical and cost-effective evaluation tool for investigating the performance behaviour of GPS systems under heterogeneous network traffic with various parameter settings. Copyright 2007 acm.
Designing open and distributed systems that can dynamically adapt in a predictable way to unexpected events is a challenging issue still not solved. Achieving this objective is a very complex task since it implies rea...
详细信息
ISBN:
(纸本)1595934804
Designing open and distributed systems that can dynamically adapt in a predictable way to unexpected events is a challenging issue still not solved. Achieving this objective is a very complex task since it implies reasoning at run-time, explicitly and in a combined way, on a system's functional and non-functional characteristics. This paper proposes a service-oriented architectural model allowing the dynamic enforcement of formally expressed metadata-based resilience policies. It also describes preliminary dynamic resilience experiments acting as proof of concept. Copyright 2007 acm.
We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has crossing number at most k, and if this is the case, computes a drawing of the graph in the plane with at m...
详细信息
ISBN:
(纸本)9781595936318
We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has crossing number at most k, and if this is the case, computes a drawing of the graph in the plane with at most k crossings. This answers the question posed by Grohe (STOC'01 and JCSS 2004). Our algorithm can be viewed as a generalization of the seminal result by Hopcroft and Tarjan [26], which determines if a given graph is planar in linear time. Our algorithm can also be compared to the algorithms by Mohar (STOC'96 and Siam J. Discrete Math 2001.), for testing the embeddability of an input graph in a fixed surface. For each surface S, Mohar describes an algorithm which yields either an embedding of G in S or a minor of G which is not embeddable in S and is minimal with this property. The same approach allows us to obtain linear time algorithms for the same question for a variety of other crossing numbers. We can also determine in linear time if an input graph can be made planar by the deletion of k edges (for fixed k).
Undergraduate students who perform research benefit greatly from the experience, yet achieving high levels of voluntary participation remains an elusive goal. This paper describes the implementation of an innovative l...
详细信息
ISBN:
(纸本)9781595932594
Undergraduate students who perform research benefit greatly from the experience, yet achieving high levels of voluntary participation remains an elusive goal. This paper describes the implementation of an innovative laboratory model designed to encourage computer science undergraduates to actively pursue collaborative research with faculty and other students. As an extension of earlier research into team-based software engineering education, the appliedcomputing Technology Laboratory was formed to provide an authentic and engaging experience in real-world computer science research. The model, which relies on a web site as its focus, is presented along with the results of one year of active research. Copyright 2006 acm.
In 2001, the acm and the IEEE-CS published computing Curricula 2001 which contains curriculum recommendations for undergraduate programs in computer science. That report also called for additional discipline-specific ...
详细信息
ISBN:
(纸本)9781595932594
In 2001, the acm and the IEEE-CS published computing Curricula 2001 which contains curriculum recommendations for undergraduate programs in computer science. That report also called for additional discipline-specific volumes for each of computer engineering, information systems, and software engineering. In addition, it called for an Overview Volume to provide a synthesis of the various volumes. The computing Curricula 2004 Task Force undertook the job of fulfilling the latter charge. The purpose of this session is to present the recently completed work of that Task Force, now known as computing Curricula 2005 (CC2005), and to generate discussion among, and feedback from SIGCSE members about ongoing and future work.
暂无评论