Eli Tilevich and Yannis Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Conference on Object-Oriented Programming (ECOOP), Malaga, June 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Portable and Efficient Distributed Threads for Java - Eli Tilevich And (2004) Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
Eli Tilevich and Yannis Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Conference on Object-Oriented Programming (ECOOP), Malaga, June 2002.
Appletizing: Running Legacy Java Code Remotely from a.. - Tilevich, Smaragdakis.. Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
Eli Tilevich and Yannis Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Conference on Object-Oriented Programming (ECOOP), June 2002.
Automatic Partitioning: A Promising Approach to.. - Liogkas.. (2004) Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
Tilevich, E., and Smaragdakis, Y., " J-Orchestra: Automatic Java Application Partitioning" , European Conference on Object-Oriented Programming (ECOOP), 2002.
Binary Refactoring: Improving Code behind the Scenes - Tilevich, al. (2005) Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
E. Tilevich and Y. Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Conference on Object-Oriented Programming (ECOOP) 2002.
Binary Refactoring: Improving Code behind the Scenes - Tilevich, al. (2005) Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
E. Tilevich and Y. Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Conference on Object-Oriented Programming (ECOOP) 2002.
Scalable Automatic Partitioning with J-Orchestra - Eli Tilevich And Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
Eli Tilevich and Yannis Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Conference on Object-Oriented Programming (ECOOP), June 2002.
Portable and Efficient Distributed Threads for Java - Tilevich, Smaragdakis (2004) Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
Eli Tilevich and Yannis Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Conference on Object-Oriented Programming (ECOOP), Malaga, June 2002.
Automatic Partitioning: A Promising Approach to.. - Liogkas.. (2004) Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
Tilevich, E., and Smaragdakis, Y., " J-Orchestra: Automatic Java Application Partitioning" , European Conference on Object-Oriented Programming (ECOOP), 2002.
Portable and Efficient Distributed Threads for Java - Tilevich, Smaragdakis (2004) Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
Eli Tilevich and Yannis Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Conference on Object-Oriented Programming (ECOOP), Malaga, June 2002.
Automatic Partitioning: A Promising Approach to.. - Liogkas.. (2004) Self-citation (Tilevich Smaragdakis) (Correct)
No context found.
Tilevich, E., and Smaragdakis, Y., " J-Orchestra: Automatic Java Application Partitioning" , European Conference on Object-Oriented Programming (ECOOP), 2002.
NRMI: Natural and Efficient Middleware - Tilevich, Smaragdakis (2003) (2 citations) Self-citation (Tilevich Smaragdakis) (Correct)
....relieve the programmer from the burden of dealing with the idiosyncrasies of various middleware mechanisms. At the same time, this reduces the field of application to programs where locality patterns are very clear cut otherwise performance can suffer greatly. In the Java world, the J Orchestra [19], Addistant [18] and Pangaea [12] 13] systems can be classified as automatic partitioning tools. The JavaParty infrastructure [5] 11] works much like an automatic partitioning tool, but gives a little more programmatic control to the programmer. JavaParty is designed to ease distributed cluster ....
Eli Tilevich and Yannis Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Malaga, Spain, June 2002.
J-Orchestra: Automatic Java Application Partitioning - Tilevich, Smaragdakis (2002) (2 citations) Self-citation (Tilevich Smaragdakis) (Correct)
....are similar to the ones used by JavaParty (but JavaParty operates at the source code level while J Orchestra is a bytecode translator) Due to lack of space, we omit some of the more involved topics, like dealing with arrays and object identity. The interested reader can find more information in [20]. Maintaining exactly the local execution semantics is not always possible or efficient. We will identify the few features for which J Orchestra will not guarantee, by need or by choice, that the partitioned application will behave exactly like the original one. 4.3.1 Static Methods and Fields ....
....loading code that was not rewritten by J Orchestra may fail because the code may try to access remote data directly. Additionally, dynamically loading code that calls JOrchestra rewritten code may violate the security guarantees of the original application (we discuss the problem in more detail in [20]) Nevertheless, one can imagine a loader installed by J Orchestra that takes care of rewriting any dynamically loaded classes before they are used. Essentially, this would implement the entire J Orchestra translation at load time. Unfortunately, classification cannot be performed incrementally: ....
Eli Tilevich and Yannis Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", Georgia Tech, CoC Tech. Report, GIT-CC-02-17, 2002.
Automatic Application Partitioning: The J-Orchestra approach - Tilevich, Smaragdakis (2002) Self-citation (Tilevich Smaragdakis) (Correct)
....partitioning system for Java programs. J Orchestra takes as input Java applications in bytecode format and transforms them into distributed applications, running on distinct Java Virtual Machines. The present paper is a high level supplement of our paper in the ECOOP 2002 technical program [12]. Here, we do not describe specific technical contributions, but instead we concentrate on the high level design decisions for an automatic partitioning system and argue that the J Orchestra decisions make sense. 1. Introduction Programming distributed applications used to be a task reserved ....
....Regular objects become mobile objects and complex mobility scenarios can be specified. Serious correctness issues when dealing with unmodifiable code (e.g. code in the Java system classes) are addressed in novel ways. A thorough technical presentation of J Orchestra can be found in Reference [12]. In this paper, we will not argue so much that J Orchestra is technically interesting but that J Orchestra is potentially very useful in practice. We will argue that the time for automatic partitioning is right and that J Orchestra makes the right choices in order to maximize the potential ....
[Article contains additional citation context not shown here]
Eli Tilevich and Yannis Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning", European Conference on Object-Oriented Programming (ECOOP), Malaga, June 2002.
Profile-Guided Java Program Partitioning for Power Aware.. - Tallam, Gupta (Correct)
No context found.
E. Tilevich and Y. Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning," European Conference on Object-Oriented Programming (ECOOP), 2002.
Jarcler: Aspect-Oriented Middleware for Distributed - Software In Java (Correct)
No context found.
Tilevich, E. and Y. Smaragdakis, "J-Orchestra: Automatic Java Application Partitioning," in ECOOP 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC