Search For:

Displaying 1-13 out of 13 total
Monetary Cost-Aware Checkpointing and Migration on Amazon Cloud Spot Instances
Found in: IEEE Transactions on Services Computing
By Sangho Yi,Artur Andrzejak,Derrick Kondo
Issue Date:September 2012
pp. 512-524
Recently introduced spot instances in the Amazon Elastic Compute Cloud (EC2) offer low resource costs in exchange for reduced reliability; these instances can be revoked abruptly due to price and demand fluctuations. Mechanisms and tools that deal with the...
 
Towards Real-Time, Volunteer Distributed Computing
Found in: Cluster Computing and the Grid, IEEE International Symposium on
By Sangho Yi, Emmanuel Jeannot, Derrick Kondo, David P. Anderson
Issue Date:May 2011
pp. 154-163
Many large-scale distributed computing applications demand real-time responses by soft deadlines. To enable such real-time task distribution and execution on the volunteer resources, we previously proposed the design of the real-time volunteer computing pl...
 
Reducing Costs of Spot Instances via Checkpointing in the Amazon Elastic Compute Cloud
Found in: Cloud Computing, IEEE International Conference on
By Sangho Yi, Derrick Kondo, Artur Andrzejak
Issue Date:July 2010
pp. 236-243
Recently introduced spot instances in the Amazon Elastic Compute Cloud (EC2) offer lower resource costs in exchange for reduced reliability; these instances can be revoked abruptly due to price and demand fluctuations. Mechanisms and tools that deal with t...
 
Energy-Efficient Data Aggregation Protocol for Location-Aware Wireless Sensor Networks
Found in: Parallel and Distributed Processing with Applications, International Symposium on
By Hong Min, Sangho Yi, Junyoung Heo, Yookun Cho, Jiman Hong
Issue Date:December 2008
pp. 751-756
The energy is the most critical resource in wireless sensor networks. Many energy efficient techniques have been studied especially in communication protocol. Among these protocols, PEGASIS proposed by Lindsey is the most superior interms of energy efficie...
 
Decision Model for Cloud Computing under SLA Constraints
Found in: Modeling, Analysis, and Simulation of Computer Systems, International Symposium on
By Artur Andrzejak, Derrick Kondo, Sangho Yi
Issue Date:August 2010
pp. 257-266
With the recent introduction of Spot Instances in the Amazon Elastic Compute Cloud (EC2), users can bid for resources and thus control the balance of reliability versus monetary costs. A critical challenge is to determine bid prices that minimize monetary ...
 
Towards a total recall: an activity tracking and recall mechanism for mobile devices
Found in: Proceedings of the 28th Annual ACM Symposium on Applied Computing (SAC '13)
By Hyun-Jin Choi, Jaehyuck Shin, Sangho Yi, Yoonkyong Lee
Issue Date:March 2013
pp. 570-572
This paper presents an activity tracking and recall mechanism so called TR for mobile handheld devices such as smartphones. A goal of the TR is to provide both a practical and extensible information tracking, storing, and retrieval way for user-centric mob...
     
Arbiter-Recall: a new function update scheme by arbitration between a remote call and a dynamic update for wireless sensor networks
Found in: Proceedings of the 2009 ACM symposium on Applied Computing (SAC '09)
By Hong Min, Injoo Jeong, Sangho Yi, Yeongkwun Kim, Yookun Cho
Issue Date:March 2009
pp. 1-5
In this paper, we propose Arbiter-Recall, which is a new kind of function code update management. When a function requires updating, Arbiter-Recall adaptively selects an energy-efficient method, deciding between a remote-call and a local-call after updatin...
     
Impact of function inlining on resource-constrained embedded systems
Found in: Proceedings of the 2009 ACM symposium on Applied Computing (SAC '09)
By Bongjae Kim, Jiman Hong, Sangho Yi, Yookun Cho
Issue Date:March 2009
pp. 1-5
With the development of computer systems, function inlining schemes were used to reduce execution time while increasing codes. In embedded systems such as wireless sensor nodes, there are extreme limitations on memory space and battery power. This is the r...
     
PreeMe: preemptive real-time task management for event-driven sensor operating systems
Found in: Proceedings of the 2008 ACM symposium on Applied computing (SAC '08)
By Hong Min, Injoo Jeong, Sangho Yi, Yeongkwun Kim, Yookun Cho
Issue Date:March 2008
pp. 28-34
This paper proposes PreeMe, which is a preemptive realtime task management scheme for event-driven sensor operating systems. By efficiently allocating independent stack space for each task, PreeMe enables the preemptive task management for the event-driven...
     
SESAME: space-efficient stack allocation mechanism for multi-threaded sensor operating systems
Found in: Proceedings of the 2007 ACM symposium on Applied computing (SAC '07)
By Hong Min, Injoo Jeong, Sangho Yi, Seungwoo Lee, Yeongkwun Kim
Issue Date:March 2007
pp. 1201-1202
This paper proposes a SESAME, which is a Space-Efficient Stack Allocation MEchanism for multi-threaded sensor operating systems. It adaptively adjusts the stack size by allocating or releasing additional stack frame based on the amount of each function's s...
     
An efficient dynamic memory allocator for sensor operating systems
Found in: Proceedings of the 2007 ACM symposium on Applied computing (SAC '07)
By Hong Min, Jiman Hong, Sangho Yi, Yookun Cho
Issue Date:March 2007
pp. 1159-1164
Dynamic memory allocation mechanism is important aspect of operating system, because an efficient dynamic memory allocator improves the performance of operating systems. In wireless sensor networks, sensor nodes have miniature computing device, small memor...
     
Adaptive page-level incremental checkpointing based on expected recovery time
Found in: Proceedings of the 2006 ACM symposium on Applied computing (SAC '06)
By Jiman Hong, Junyoung Heo, Sangho Yi, Yookun Cho
Issue Date:April 2006
pp. 1472-1476
Incremental checkpointing, which is intended to minimize checkpointing overhead, saves only the modified pages of a process. This means that in incremental checkpointing, the time consumed for checkpointing varies according to the amount of modified pages....
     
Space-efficient page-level incremental checkpointing
Found in: Proceedings of the 2005 ACM symposium on Applied computing (SAC '05)
By Jiman Hong, Junyoung Heo, Sangho Yi, Sung Y. Shin, Yookun Cho
Issue Date:March 2005
pp. 1558-1562
Incremental checkpointing, which is intended to minimize checkpointing overhead, saves only the modified pages of a process. However, the cumulative size of incremental checkpoints increases at a steady rate over time because many updated values may be sav...
     
 1