17124028
Probabilistic Observation Prediction Model based E4 Scheduling Mechanism in Peer to Peer Grid Computing
Peer to peer (P2P) grid computing is an Internet-based parallel computing paradigm to achieve tremendous computing power by voluntary peers. Since peers are not dedicated to a system, peers are free to leave and join autonomously during computation in this computing environment. A scheduling mechanism must cover the volatility of peers to support a reliable P2P grid computing system. Most existing P2P grid computing systems, however, suffer from blocked job execution and delayed makespan because they do not consider the volatile features of peers in the scheduling procedure. In order to improve system reliability, we propose a probabilistic observation prediction (POP) -based EA scheduling mechanism supporting three advanced scheduling policies: loose time constraint policy (LTCP), strict time constraint policy (STCP), and hybrid time constraint policy (HTCP). LTCP is for general use, STCP aims at minimizing makespan, and HTCP attempts to improve efficiency, and performance-to-cost ratio. All policies are based on stochastic modeling of peer state transition while endeavoring to manage the volatile features of peers
24012185
Dynamic Scheduling Mechanism for Result Certification in Peer to Peer Grid Computing
In a peer to peer grid computing environment, volunteers have heterogeneous properties and dynamically join and leave during execution. Therefore, it is essential to adapt to an unstable and widely distributed environment. However, existing scheduling and result certification mechanisms do not adapt to such a dynamic environment. As a result, they undergo high overhead, performance degradation, and scalability problems. 
 
To solve the problems, we propose a new scheduling mechanism for result certification. The proposed mechanism applies different scheduling and result certification algorithms to different volunteer groups that are classified on the basis of their properties such as volunteering service time, availability, and credibility. It also exploits mobile agents in a distributed way in order to adapt to a dynamic peer to peer grid computing environment.
10832557
Adaptive group scheduling mechanism using mobile agents in peer-to-peer grid computing environment
Peer-to-peer grid computing is an attractive computing paradigm for high throughput applications. However, both volatility due to the autonomy of volunteers (i.e., resource providers) and the heterogeneous properties of volunteers are challenging problems in the scheduling procedure. Therefore, it is necessary to develop a scheduling mechanism that adapts to a dynamic peer-to-peer grid computing environment. In this paper, we propose a Mobile Agent based Adaptive Group Scheduling Mechanism (MAAGSM). The MAAGSM classifies and constructs volunteer groups to perform a scheduling mechanism according to the properties of volunteers such as volunteer autonomy failures, volunteer availability, and volunteering service time. In addition, the MAAGSM exploits a mobile agent technology to adaptively conduct various scheduling, fault tolerance, and replication algorithms suitable for each volunteer group. Furthermore, we demonstrate that the MAAGSM improves performance by evaluating the scheduling mechanism in Korea@Home.
9484226
Group-based dynamic computational replication mechanism in peer-to-peer grid computing
A peer-to-peer grid computing is complicated by heterogeneous capabilities, failures, volatility, and lack of trust because it is based on desktop computers at the edge of the Internet. In order to improve the reliability of computation and gain better performance, a replication mechanism must adapt to these distinct features. In other words, it is required to classify volunteers into groups that have similar properties and then dynamically apply different replication algorithms to each group. However, existing mechanisms do not provide such a replication mechanism on a per group basis. As a result, they cause a high overhead and poor performance. To solve the problems, we propose a new group-based computational replication mechanism to adapt to an unstable, untrusted, dynamic peer-to-peer grid computing environment. Our mechanism can reduce the number of redundancy and therefore complete many tasks by adaptively replicating computations on the basis of the properties of volunteer group such as availability, credibility, and volunteering service time
14154834
Region-based stage construction protocol for fault tolerant execution of mobile agent
Fault tolerance is essential to the development of reliable mobile agent systems in order to guarantee continuous execution of mobile agents. For this purpose, previous work has proposed fault tolerant protocols for mobile agent execution based on stage construction. However, when previous protocols are applied to a multiregion mobile agent computing environment, the overhead of work such as monitoring, election, voting and agreement is increased. We propose a region-based stage construction (RBSC) protocol for fault tolerant execution of mobile agents in a multiregion mobile agent computing environment. The RBSC protocol uses new concepts of quasiparticipant and substage in order to put together some places located in different regions within a stage in the same region. Therefore, the RBSC protocol decreases the overhead of stage works. Consequently, the RBSC protocol decreases the total execution time of mobile agents.
41968338
Group-Based Scheduling Scheme for Result Checking in Global Computing Systems
This paper considers the problem of correctness to fault-tolerance in global computing systems. Global computing system has been shown to be exposed to intentional attacks, where authentication is not relevant, network security techniques are insufficient. To guarantee correctness for computation, fault-tolerance schemes have been used to majority voting and spot-checking but these schemes intend to high computation delay because are not applied scheduling scheme for result checking. In this paper, we propose a new technique called GBSS(Group-Based Scheduling Scheme) which guarantee correctness and reduce computation delay by using fault-tolerant scheduling scheme to the result checking. Additionally, simulation results show increased usable rate of the CPU and increased performance of the system.
19983253
A selective DVS technique based on battery residual
Abstract Conventional research on DVS assumes that the battery, which is the power source of most mobile devices, provides constant power; the battery, however, has unique discharge characteristics due to its chemical properties. Based on the residual characteristics of the battery, this paper presents a practical approach towards a battery-aware DVS mechanism that can easily be applied to conventional operating systems. The proposed policy monitors the battery residual in runtime, classifies the current battery state as one of three—the recovery effect region, the rate capacity region and the alarm region—then applies a suitable DVS algorithm according to each region, which takes advantage of the underlying battery characteristics. Experiments on commercial PDAs (iPAQ5550 and Zaurus SL-860 PDA) running MPEG applications showed that our policy significantly extends the battery lifetime, compared to the conventional DVS method, with only a marginal QoS degradation.
1958153
Maintaining Consistency Under Isolation Relaxation of Web Services Transactions
For efficiently managing Web Services (WS) transactions which are executed across multiple loosely-coupled autonomous organizations, isolation is commonly relaxed. A Web services operation of a transaction releases locks on its resources once its jobs are completed without waiting for the completions of other operations. However, those early unlocked resources can be seen by other transactions, which can spoil data integrity and causes incorrect outcomes. Existing WS transaction standards do not consider this problem. In this paper, we propose a mechanism to ensure the consistent executions of isolation-relaxing WS transactions. The mechanism effectively detects inconsistent states of transactions with a notion of a completion dependency and recovers them to consistent states. We also propose a new Web services Transaction Dependency management Protocol (WTDP). WTDP helps organizations manage the WS transactions easily without data inconsistency. WTDP is designed to be compliant with a representative WS transaction standard, the Web Services Transactions specifications, for easy integration into existing WS transaction systems. We prototyped a WTDP-based WS transaction management system to validate our protocol.
3513935
A dynamic mechanism for time-constrained trading
The market mechanism design is important for both conventional and electronic commerce as it affects the fairness and efficiency of trading. In this paper, we propose a new market mechanism for time- constrained trading. Our mechanism mimics the traditional brokering system, where buyers and sellers meet together and negotiate through an electronic marketplace. At each time step, agents are paired up for negotiating a deal. We consider that buyer and seller agents are associated with a time constraint and a search cost, and thus must decide promptly and judiciously whether to accept an offer. One distinguishing feature of our mechanism is that the marketplace provides buyer and seller agents with statistical information about the goods. Specifically, the statistics include the probability distributions of obtaining and losing a particular offer. With this information, the agents' decision can be viewed as a Markov decision process, and the optimal (dominant) trading strategy can be computed. In other words, buyer and seller agents can make trading decisions that maximize their expected utility without the need of speculating others actions. We also explain how such a dominant strategy can be computed in an efficient manner. Another distinguishing feature of the proposed mechanism is that the statistics are updated continuously and hence the dominant trading strategy is adaptive. Experimental results verify that our mechanism facilitates a fair allocation to the trading agents under various demand and supply conditions.
5975093
Multi-chain prefetching: effective exploitation of inter-chain memory parallelism for pointer-chasing codes
Presents multi-chain prefetching, a technique that utilizes offline analysis and a hardware prefetch engine to prefetch multiple independent pointer chains simultaneously, thus exploiting inter-chain memory parallelism for the purpose of memory latency tolerance. This paper makes three contributions. First, we introduce a scheduling algorithm that identifies independent pointer chains in pointer-chasing codes and computes a prefetch schedule that overlaps serialized cache misses across separate chains. Our analysis focuses an static traversals. We also propose using speculation to identify independent pointer chains in dynamic traversals. Second, we present the design of a prefetch engine that traverses pointer-based data structures and overlaps multiple pointer chains according to our scheduling algorithm. Finally, we conduct an experimental evaluation of multi-chain prefetching and compare its performance against two existing techniques: jump pointer prefetching and prefetch arrays. Our results show that multi-chain prefetching improves the execution time by 40% across six pointer-chasing kernels from the Olden benchmark suite and by 8% across four SPECInt CPU2000 benchmarks. Multi-chain prefetching also outperforms jump pointer prefetching and prefetch arrays by 28% on Olden, and by 12% on SPECInt. Furthermore, speculation can enable multi-chain prefetching for some dynamic traversal codes, but our technique loses its effectiveness when the pointer-chain traversal order is unpredictable. Finally, we also show that combining multi-chain prefetching with prefetch arrays can potentially provide higher performance than either technique alone.
53244399
RETOS: resilient, expandable, and threaded operating system for wireless sensor networks
accelerated bythereadily-available hardware platforms, aswellas Thispaperpresents thedesign principles, implementation, and coresystem software suchassensornodeoperating systems in evaluation oftheRETOSoperating system whichisspecifically particular. Fromtheearly days, mucheffort hasbeengiven to developed formicrosensor nodes. RETOS hasfourdistinctdevelop efficient andyetcomplete operating systems formicro objectives, which aretoprovide (1) amultithreaded programming sensornodes. Forinstance, TinyOS [1] hashistorically beenusedby interface, (2)system resiliency, (3)kerelextensibility with manypractitioners inthefield andeven advocated as "the" dynamic reconfiguration, and (4)WSN-oriented network operating system forWSN.Otheroperating systems suchas