首页> 外国专利> Determining the largest group of dependent software updates that are valid for installation

Determining the largest group of dependent software updates that are valid for installation

机译:确定对安装有效的最大一组相关软件更新

摘要

Described is a system and method by which a collection of software packages for installing (e.g., on an embedded computing device) are reviewed for their dependent relations, whereby it is possible to choose a maximal set of install possibilities to allow for maximal version updates for any given package in the fewest update steps possible, while honoring package dependency constraints. An update validation process organizes and validates update packages that have been downloaded to a device, and builds a graph for each group. The graph data including paths between updates are processed to validate the updates and to determine a minimal and optimal set of packages that can be applied to the existing image on the device to produce the desired update, with the least amount of weight (cost) when more than one path can be used to get to the same version.
机译:描述了一种系统和方法,通过该系统和方法检查用于安装(例如,在嵌入式计算设备上)的软件包的集合的依赖关系,从而可以选择最大的安装可能性集以允许最大的版本更新。在遵守软件包依赖关系约束的前提下,以最少的更新步骤完成任何给定的软件包。更新验证过程组织并验证已下载到设备的更新程序包,并为每个组构建图形。处理包括更新之间的路径的图形数据以验证更新并确定可应用于设备上现有图像以产生所需更新的最小和最佳软件包集合,当重量最小时(成本)可以使用多个路径来获得相同的版本。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号