John McCarthy proposed the vision of utility computing in 1961.Barbara Liskov proposed a related vision of abstraction-powered Internet Computer in 2009.This position paper outlines a distributed computing model towar...John McCarthy proposed the vision of utility computing in 1961.Barbara Liskov proposed a related vision of abstraction-powered Internet Computer in 2009.This position paper outlines a distributed computing model towards realizing the McCarthy-Liskov vision.This“hypertasking”model aims at extending the“hypermedia”model of the World Wide Web into a model of World Wide Computing Utility,turning an information web into a computing web.The hypertasking model contains three abstractions,including global resource space,stored-computer architecture,and monadic hypermedia.A prototype architecture and experimental evidence are presented to support this perspective.展开更多
In a 1961 lecture to celebrate MIT’s centennial,John McCarthy proposed the vision of utility computing,including three key concepts of pay-per-use service,large computer and private computer.Six decades have passed,b...In a 1961 lecture to celebrate MIT’s centennial,John McCarthy proposed the vision of utility computing,including three key concepts of pay-per-use service,large computer and private computer.Six decades have passed,but Mc-Carthy’s computing utility vision has not yet been fully realized,despite advances in grid computing,services computing and cloud computing.This paper presents a perspective of computing utility called Information Superbahn,building on recent advances in cloud computing.This Information Superbahn perspective retains McCarthy’s vision as much as possible,while making essential modern requirements more explicit,in the new context of a networked world of billions of users,trillions of devices,and zettabytes of data.Computing utility offers pay-per-use computing services through a 1)planetscale,2)low-entropy and 3)high-goodput utility.The three salient characteristics of computing utility are elaborated.Initial evidence is provided to support this viewpoint.展开更多
Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,...Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,scheduling and executing large-scale computing tasks efficiently and allocating resources to tasks reasonably are becoming a quite challenging problem.To improve both task execution and resource utilization efficiency,we present a task scheduling algorithm with resource attribute selection,which can select the optimal node to execute a task according to its resource requirements and the fitness between the resource node and the task.Experiment results show that there is significant improvement in execution throughput and resource utilization compared with the other three algorithms and four scheduling frameworks.In the scheduling algorithm comparison,the throughput is 77%higher than Min-Min algorithm and the resource utilization can reach 91%.In the scheduling framework comparison,the throughput(with work-stealing)is at least 30%higher than the other frameworks and the resource utilization reaches 94%.The scheduling algorithm can make a good model for practical MTC applications.展开更多
With the aid of Riemann–Liouville fractional calculus theory,fractional order Savitzky–Golay differentiation（FOSGD） is calculated and applied to pretreat near infrared（NIR） spectra in order to improve the perfor...With the aid of Riemann–Liouville fractional calculus theory,fractional order Savitzky–Golay differentiation（FOSGD） is calculated and applied to pretreat near infrared（NIR） spectra in order to improve the performance of multivariate calibrations.Similar to integral order Savitzky–Golay differentiation（IOSGD）,FOSGD is obtained by fitting a spectral curve in a moving window with a polynomial function to estimate its coefficients and then carrying out the weighted average of the spectral curve in the window with the coefficients.Three NIR datasets including diesel,wheat and corn datasets were utilized to test this method.The results showed that FOSGD,which is easy to compute,is a general method to obtain Savitzky–Golay smoothing,fractional order and integral order differentiations.Fractional order differentiation computation to the NIR spectra often improves the performance of the PLS model with smaller RMSECV and RMSEP than integral order ones,especially for physical properties of interest,such as density,cetane number and hardness.展开更多
基金supported by the National Natural Science Foundation of China under Grant Nos.62072434 and U23B2004.
文摘John McCarthy proposed the vision of utility computing in 1961.Barbara Liskov proposed a related vision of abstraction-powered Internet Computer in 2009.This position paper outlines a distributed computing model towards realizing the McCarthy-Liskov vision.This“hypertasking”model aims at extending the“hypermedia”model of the World Wide Web into a model of World Wide Computing Utility,turning an information web into a computing web.The hypertasking model contains three abstractions,including global resource space,stored-computer architecture,and monadic hypermedia.A prototype architecture and experimental evidence are presented to support this perspective.
基金supported in part by the State Key Laboratory of Computer Architecture of China under Grant No.CARCH 5206the Strategic Priority Research Program of the Chinese Academy of Sciences under Grant No.XDB44030000.
文摘In a 1961 lecture to celebrate MIT’s centennial,John McCarthy proposed the vision of utility computing,including three key concepts of pay-per-use service,large computer and private computer.Six decades have passed,but Mc-Carthy’s computing utility vision has not yet been fully realized,despite advances in grid computing,services computing and cloud computing.This paper presents a perspective of computing utility called Information Superbahn,building on recent advances in cloud computing.This Information Superbahn perspective retains McCarthy’s vision as much as possible,while making essential modern requirements more explicit,in the new context of a networked world of billions of users,trillions of devices,and zettabytes of data.Computing utility offers pay-per-use computing services through a 1)planetscale,2)low-entropy and 3)high-goodput utility.The three salient characteristics of computing utility are elaborated.Initial evidence is provided to support this viewpoint.
基金ACKNOWLEDGEMENTS The authors would like to thank the reviewers for their detailed reviews and constructive comments, which have helped improve the quality of this paper. The research has been partly supported by National Natural Science Foundation of China No. 61272528 and No. 61034005, and the Central University Fund （ID-ZYGX2013J073）.
文摘Many Task Computing(MTC)is a new class of computing paradigm in which the aggregate number of tasks,quantity of computing,and volumes of data may be extremely large.With the advent of Cloud computing and big data era,scheduling and executing large-scale computing tasks efficiently and allocating resources to tasks reasonably are becoming a quite challenging problem.To improve both task execution and resource utilization efficiency,we present a task scheduling algorithm with resource attribute selection,which can select the optimal node to execute a task according to its resource requirements and the fitness between the resource node and the task.Experiment results show that there is significant improvement in execution throughput and resource utilization compared with the other three algorithms and four scheduling frameworks.In the scheduling algorithm comparison,the throughput is 77%higher than Min-Min algorithm and the resource utilization can reach 91%.In the scheduling framework comparison,the throughput(with work-stealing)is at least 30%higher than the other frameworks and the resource utilization reaches 94%.The scheduling algorithm can make a good model for practical MTC applications.
基金supported by Science and Technology Commission of Shanghai Municipality (No.14142201400)
文摘With the aid of Riemann–Liouville fractional calculus theory,fractional order Savitzky–Golay differentiation（FOSGD） is calculated and applied to pretreat near infrared（NIR） spectra in order to improve the performance of multivariate calibrations.Similar to integral order Savitzky–Golay differentiation（IOSGD）,FOSGD is obtained by fitting a spectral curve in a moving window with a polynomial function to estimate its coefficients and then carrying out the weighted average of the spectral curve in the window with the coefficients.Three NIR datasets including diesel,wheat and corn datasets were utilized to test this method.The results showed that FOSGD,which is easy to compute,is a general method to obtain Savitzky–Golay smoothing,fractional order and integral order differentiations.Fractional order differentiation computation to the NIR spectra often improves the performance of the PLS model with smaller RMSECV and RMSEP than integral order ones,especially for physical properties of interest,such as density,cetane number and hardness.
