The Experts below are selected from a list of 68628 Experts worldwide ranked by ideXlab platform
Selwyn Piramuthu - One of the best experts on this subject based on the ideXlab platform.
-
Real option valuation on Grid Computing
Decision Support Systems, 2008Co-Authors: Juheng Zhang, Subhajyoti Bandyopadhyay, Selwyn PiramuthuAbstract:Grid Computing essentially involves transparent access to distributed Computing where Computing resources are pooled and shared both within and among organizations. Grid Computing is increasingly becoming a viable option for businesses looking for high-end Computing requirements for relatively short periods of time. We analyze some economic decision criteria for a Grid Computing provider wishing to provide such a service to businesses. Given the large amount of uncertainty in prices and demand (which is demonstrated through Monte Carlo simulations) for such a service, a real options valuation technique is particularly suitable for such an exercise. We study the dynamics of Grid Computing from an economic perspective. Specifically, we consider a monopolist scenario providing two kinds of service, one of which might preempt the other.
Juheng Zhang - One of the best experts on this subject based on the ideXlab platform.
-
Real option valuation on Grid Computing
Decision Support Systems, 2008Co-Authors: Juheng Zhang, Subhajyoti Bandyopadhyay, Selwyn PiramuthuAbstract:Grid Computing essentially involves transparent access to distributed Computing where Computing resources are pooled and shared both within and among organizations. Grid Computing is increasingly becoming a viable option for businesses looking for high-end Computing requirements for relatively short periods of time. We analyze some economic decision criteria for a Grid Computing provider wishing to provide such a service to businesses. Given the large amount of uncertainty in prices and demand (which is demonstrated through Monte Carlo simulations) for such a service, a real options valuation technique is particularly suitable for such an exercise. We study the dynamics of Grid Computing from an economic perspective. Specifically, we consider a monopolist scenario providing two kinds of service, one of which might preempt the other.
Mummoorthy Murugesa - One of the best experts on this subject based on the ideXlab platform.
-
uncheatable Grid Computing
International Conference on Distributed Computing Systems, 2004Co-Authors: J. Jia, Manish Mangal, Mummoorthy MurugesaAbstract:Grid Computing is a type of distributed Computing that has shown promising applications in many fields. A great concern in Grid Computing is the cheating problem described in the following: a participant is given D = {x/sub 1/,...,x/sub n/}, it needs to compute f(x) for all x/spl isin/D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. We propose a novel scheme to achieve the uncheatable Grid Computing. Our scheme uses a sampling technique and the Merkle-tree based commitment technique to achieve efficient and viable uncheatable Grid Computing.
Subhajyoti Bandyopadhyay - One of the best experts on this subject based on the ideXlab platform.
-
Real option valuation on Grid Computing
Decision Support Systems, 2008Co-Authors: Juheng Zhang, Subhajyoti Bandyopadhyay, Selwyn PiramuthuAbstract:Grid Computing essentially involves transparent access to distributed Computing where Computing resources are pooled and shared both within and among organizations. Grid Computing is increasingly becoming a viable option for businesses looking for high-end Computing requirements for relatively short periods of time. We analyze some economic decision criteria for a Grid Computing provider wishing to provide such a service to businesses. Given the large amount of uncertainty in prices and demand (which is demonstrated through Monte Carlo simulations) for such a service, a real options valuation technique is particularly suitable for such an exercise. We study the dynamics of Grid Computing from an economic perspective. Specifically, we consider a monopolist scenario providing two kinds of service, one of which might preempt the other.
J. Jia - One of the best experts on this subject based on the ideXlab platform.
-
uncheatable Grid Computing
International Conference on Distributed Computing Systems, 2004Co-Authors: J. Jia, Manish Mangal, Mummoorthy MurugesaAbstract:Grid Computing is a type of distributed Computing that has shown promising applications in many fields. A great concern in Grid Computing is the cheating problem described in the following: a participant is given D = {x/sub 1/,...,x/sub n/}, it needs to compute f(x) for all x/spl isin/D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. We propose a novel scheme to achieve the uncheatable Grid Computing. Our scheme uses a sampling technique and the Merkle-tree based commitment technique to achieve efficient and viable uncheatable Grid Computing.
-
ICDCS - Uncheatable Grid Computing
24th International Conference on Distributed Computing Systems 2004. Proceedings., 2004Co-Authors: J. Jia, Manish Mangal, Mummoorthy MurugesanAbstract:Grid Computing is a type of distributed Computing that has shown promising applications in many fields. A great concern in Grid Computing is the cheating problem described in the following: a participant is given D = {x/sub 1/,...,x/sub n/}, it needs to compute f(x) for all x/spl isin/D and return the results of interest to the supervisor. How does the supervisor efficiently ensure that the participant has computed f(x) for all the inputs in D, rather than a subset of it? If participants get paid for conducting the task, there are incentives for cheating. We propose a novel scheme to achieve the uncheatable Grid Computing. Our scheme uses a sampling technique and the Merkle-tree based commitment technique to achieve efficient and viable uncheatable Grid Computing.
