-
公开(公告)号：US07478378B2
公开(公告)日：2009-01-13
申请号：US10998850
申请日：2004-11-29
CPC分类号： G06F8/71
摘要： The adaptation precedence of an application (or order of adaptation of various components) is given as a directed acyclic graph (DAG), with each vertex being an atomic unit of adaptation, or a component which comprises of atomic units of adaptation. Each such component has an associated DAG specifying the order of adaptation with vertices as sub-components. Relations among sub-components and associated actions are stored as a table. The relations between sub-components of different components follow a set of constraints in order to be compatible relations. A linear order from the partial order is created as represented by the DAG and follows that order for adaptation of each component. Each component x is adapted atomically and then the table of relations is updated appropriately. As and when a component y is to be adapted, the table is looked-up and it is determined which relations and actions are to be enforced upon y while its adaptation is being executed. A new version of the application is the output at the end of the adaptation, which is semantically consistent with the given relations and actions.
摘要翻译： 应用的适应优先级（或各种组件的适应顺序）被给出为有向非循环图（DAG），其中每个顶点是适配的原子单位，或包含原子适应单位的分量。 每个这样的组件具有相关联的DAG，其指定具有顶点的适应顺序作为子组件。 子组件和相关操作之间的关系存储为一个表。 不同组件的子组件之间的关系遵循一系列约束，以便兼容关系。 创建由DAG表示的部分顺序的线性顺序，并遵循每个组件的自适应顺序。 每个组件x原子适配，然后关系表被适当地更新。 当要调整组件y时，查找表并确定在执行其适配时在哪个关系和动作被执行。 应用程序的新版本是在适应结束时的输出，其在语义上与给定的关系和动作一致。
-
公开(公告)号：US20060130028A1
公开(公告)日：2006-06-15
申请号：US10998850
申请日：2004-11-29
IPC分类号： G06F9/45
CPC分类号： G06F8/71
摘要： The adaptation precedence of an application (or order of adaptation of various components) is given as a directed acyclic graph (DAG), with each vertex being an atomic unit of adaptation, or a component which comprises of atomic units of adaptation. Each such component has an associated DAG specifying the order of adaptation with vertices as sub-components. Relations among sub-components and associated actions are stored as a table. The relations between sub-components of different components follow a set of constraints in order to be compatible relations. A linear order from the partial order is created as represented by the DAG and follows that order for adaptation of each component. Each component x is adapted atomically and then the table of relations is updated appropriately. As and when a component y is to be adapted, the table is looked-up and it is determined which relations and actions are to be enforced upon y while its adaptation is being executed. A new version of the application is the output at the end of the adaptation, which is semantically consistent with the given relations and actions.
-
公开(公告)号：US20060004764A1
公开(公告)日：2006-01-05
申请号：US10862221
申请日：2004-06-07
申请人： Manish Kurhekar , Biplav Srivastava
发明人： Manish Kurhekar , Biplav Srivastava
IPC分类号： G06F17/30
摘要： Methods, apparatuses and computer programs for making information relating to web services available to applications hosted by a client platform and/or using such information to invoke web services for use by an application hosted by a client platform are disclosed. The information is preferably obtained from a local repository or otherwise from a remote repository via the internet. The information may relate to web services previously used by the applications such as particular invocation instances of those web services. The information may comprise statistical Quality of Service (QoS) information relating to particular invocation instances of web services.
摘要翻译： 公开了用于制作与客户端平台所托管的应用有关的Web服务的信息和/或使用这些信息来调用由客户机平台承载的应用使用的web服务的方法，装置和计算机程序。 该信息优选地从本地存储库获得，或者通过互联网从远程存储库获得。 该信息可能涉及以前由应用程序使用的Web服务，例如这些Web服务的特定调用实例。 信息可以包括与web服务的特定调用实例有关的统计服务质量（QoS）信息。
-
公开(公告)号：US20050028141A1
公开(公告)日：2005-02-03
申请号：US10630023
申请日：2003-07-30
申请人： Manish Kurhekar , Pradeep Varma , Rajkishore Barik
发明人： Manish Kurhekar , Pradeep Varma , Rajkishore Barik
摘要： Methods, compiler apparatus and a computer program product for compiling UPC source code are disclosed. UPC-unique constructs are converted into C-level form. The C-level constructs are inserted into the source code to form a combined code. The combined code is translated into an intermediate form, wherein any surviving UPC-unique components are discarded. All UPC-unique data or statements are converted to a form that can be handled by general compiler architectures, yet retain UPC properties. The resultant intermediate form is converted to compiled machine code. The generation of C-level constructs occurs at a compiler front end module, avoiding difficulties in intermediate code handling.
摘要翻译： 公开了用于编译UPC源代码的方法，编译装置和计算机程序产品。 UPC唯一的构造转换为C级形式。 将C级结构插入到源代码中以形成组合代码。 组合的代码被转换成中间形式，其中任何幸存的UPC唯一组件被丢弃。 所有UPC唯一的数据或语句都将转换为可由一般编译器架构处理的表单，但保留UPC属性。 所得到的中间格式转换为编译的机器代码。 C级结构的生成发生在编译器前端模块，避免了中间代码处理的困难。
-
公开(公告)号：US07254809B2
公开(公告)日：2007-08-07
申请号：US10630023
申请日：2003-07-30
申请人： Manish Kurhekar , Pradeep Varma , Rajkishore Barik
发明人： Manish Kurhekar , Pradeep Varma , Rajkishore Barik
摘要： Methods, compiler apparatus and a computer program product for compiling UPC source code are disclosed. UPC-unique constructs are converted into C-level form. The C-level constructs are inserted into the source code to form a combined code. The combined code is translated into an intermediate form, wherein any surviving UPC-unique components are discarded. All UPC-unique data or statements are converted to a form that can be handled by general compiler architectures, yet retain UPC properties. The resultant intermediate form is converted to compiled machine code. The generation of C-level constructs occurs at a compiler front end module, avoiding difficulties in intermediate code handling.
摘要翻译： 公开了用于编译UPC源代码的方法，编译装置和计算机程序产品。 UPC唯一的构造转换为C级形式。 将C级结构插入到源代码中以形成组合代码。 组合的代码被转换成中间形式，其中任何幸存的UPC唯一组件被丢弃。 所有UPC唯一的数据或语句都将转换为可由一般编译器体系结构处理的表单，但保留UPC属性。 所得到的中间格式转换为编译的机器代码。 C级结构的生成发生在编译器前端模块，避免了中间代码处理的困难。
-
-
-
-
搜索结果
5 条记录 (耗时 0.043 秒)
