Search For:

Displaying 1-9 out of 9 total
Dynamic Graph Traversals for Concurrent Rewriting Using Work-Stealing Frameworks for Multicore Platforms
Found in: Parallel and Distributed Systems, International Conference on
By Masahiro Yasugi, Tasuku Hiraishi, Seiji Umatani, Taiichi Yuasa
Issue Date:December 2010
pp. 406-414
Parallel programming/execution frameworks for multicore platforms should support as many applications as possible. In general, work-stealing frameworks provide efficient load balancing even for irregular parallel applications. Unfortunately, naive parallel...
 
Project Report: Toward the Realization of Highly Reliable Embedded Systems
Found in: Object-Oriented Real-Time Distributed Computing, IEEE International Symposium on
By Takuya Katayama, Tomoji Kishi, Shintaro Hosoai, Tatsuo Nakajima, Taiichi Yuasa, Midori Sugaya, Tomoharu Ugawa
Issue Date:March 2009
pp. 105-111
Our society depend on embedded and ubiquitous computingand the reliability of embedded software becomesmore and more important. We have conducted a five yearsproject with industries to develop software for realizinghighly reliable embedded systems. We have...
 
Replication-Based Incremental Compaction
Found in: Object-Oriented Real-Time Distributed Computing, IEEE International Symposium on
By Tomoharu Ugawa, Masahiro Yasugi, Taiichi Yuasa
Issue Date:May 2008
pp. 516-524
We propose an incremental compaction algorithm. Our compactor selects a continuous area of the heap and evacuates it by incrementally copying all objects in the area to the rest of the heap. After all objects have been copied, our compactor incrementally u...
 
Improving Search Speed on Pointer-Based Large Data Structures Using a Hierarchical Clustering Copying Algorithm
Found in: Innovative Architecture for Future Generation High-Performance Processors and Systems, International Workshop on
By Masahiro Yasugi, Taiichi Yuasa
Issue Date:January 2007
pp. 43-52
The increasing processor-memory performance gap makes improving the cache locality as important as the virtual memory locality. In many applications, especially in search algorithms on pointer-based large data structures, breadth-first copying algorithms i...
 
Real-Time GC in JeRTy™VM Using the Return-Barrier Method
Found in: Object-Oriented Real-Time Distributed Computing, IEEE International Symposium on
By Hideaki Saiki, Yoshiharu Konaka, Tsuneyasu Komiya, Masahiro Yasugi, Taiichi Yuasa
Issue Date:May 2005
pp. 140-148
Runtime systems for applications written in certain languages such as Java™ and Lisp usually have a garbage collection (GC) feature to make efficient use of memory. With this feature, the system, before running out of memory space, automatically reclaims u...
 
Proactive Information Supply for Activating Conversational Interaction in Virtual Communities
Found in: Knowledge Media Networking, IEEE Workshop on
By Noriyuki Kurabayashi, Tatsuya Yamazaki, Taiichi Yuasa, Kazuo Hasuike
Issue Date:July 2002
pp. 167
This paper describes a method for activating conversational interaction in virtual communities. Our method supplies information proactively to promote utterances of participants. The notion of subjective usefulness of information is introduced to guide con...
 
ZINGER: CONVERSATION SUPPORT BASED ON INTEREST SIMILARITY
Found in: Multimedia and Expo, IEEE International Conference on
By Noriyuki Kurabayashi, Tatsuya Yamazaki, Kazuo Hasuika, Taiichi Yuasa
Issue Date:August 2001
pp. 112
In this paper, we introduce a conversation support agent called Zinger. Zinger acquires the current interest of a participant, identifies a partner who has a similar interest, and recommends several topics related to the interest. This recommendation is ex...
 
Starvation-free heap size for replication-based incremental compacting garbage collection
Found in: Proceedings of the 2010 international conference on Lisp (ILC '10)
By Hideya Iwasaki, Taiichi Yuasa, Tomoharu Ugawa
Issue Date:October 2010
pp. 43-52
We present a method to estimate the amount of the heap required to execute application programs on runtime systems with our replication-based incremental compacting garbage collector. Our method provides a strategy for adjusting the timing to trigger garba...
     
Backtracking-based load balancing
Found in: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (PPoPP '09)
By Masahiro Yasugi, Seiji Umatani, Taiichi Yuasa, Tasuku Hiraishi
Issue Date:February 2009
pp. 283-284
High-productivity languages for parallel computing become more important as parallel environments including multicores become more common. Cilk is such a language. It provides good load balancing for many applications including irregular ones; that is, it ...
     
 1