会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 7. 发明授权
    • Tracking and managing failure-susceptible operations in a computer system
    • 跟踪和管理计算机系统中的故障敏感操作
    • US06205561B1
    • 2001-03-20
    • US08989147
    • 1997-12-11
    • Pierre-Yves SanterreJason Ty CobbRaymond D. Pedrizetti
    • Pierre-Yves SanterreJason Ty CobbRaymond D. Pedrizetti
    • G06F1134
    • G06F11/3017G06F11/0769G06F11/1402G06F11/302G06F11/3089G06F11/324
    • The present invention is directed to tracking and managing failure-susceptible operations in a computer system. In a preferred embodiment, the performance of failure-susceptible operations is monitored, such that, when execution of the operating system is interrupted then restarted, it can be determined which failure-susceptible operation was in progress at the point at which execution of the operating system was interrupted. In one embodiment, this monitoring is performed using a stack data structure. When a failure-susceptible operation is invoked, an entry is pushed on the stack identifying the invoked failure-susceptible operation. On the other hand, when a failure-susceptible operation is completed, the entry identifying the completed failure-susceptible operation is popped off the stack. The failure-susceptible operation that was in progress at the point at which execution was last interrupted is then determined to be the failure-susceptible operation identified by the top entry on the stack when execution resumes. In a further preferred embodiment, subsequent attempted invocation of the operation determined to be in progress when execution was interrupted is inhibited.
    • 本发明涉及跟踪和管理计算机系统中的故障敏感操作。 在优选实施例中,监视故障敏感操作的性能,使得当操作系统的执行被中断然后重新启动时,可以确定在执行操作的点处哪个故障敏感操作正在进行中 系统中断 在一个实施例中,使用堆栈数据结构来执行该监视。 当调用故障敏感操作时,会在堆栈上推入一个条目,标识被调用的故障敏感操作。 另一方面,当故障易受影响的操作完成时,识别完成的故障易受操作的条目从堆栈中弹出。 在执行上一次中断的时刻进行中的故障易受影响的操作随后被确定为当执行恢复时由栈顶部条目识别的故障敏感操作。 在另一优选实施例中,禁止在执行中断时确定正在进行的操作的后续尝试调用。
    • 8. 发明授权
    • Method for determining steerable interrupt request lines used by PCMCIA
controllers
    • 用于确定PCMCIA控制器使用的可控中断请求线的方法
    • US5623674A
    • 1997-04-22
    • US437285
    • 1995-05-08
    • Raymond D. Pedrizetti
    • Raymond D. Pedrizetti
    • G06F13/26G06F13/00
    • G06F13/26
    • A system for determining the connections between a PCMCIA controller and a programmable interrupt controller (PIC) by simulating an interrupt request from the PCMCIA controller and then evaluating the values contained in the interrupt request register of the PIC. An interrupt request association record is stored in response to receiving the simulated interrupt request at one of the interrupt request register inputs of the programmable interrupt controller. The interrupt request association record assigns the selected interrupt request line to the interrupt request register input that received the interrupt request signal. An interrupt request output from the PCMCIA controller is considered to be connected to a particular interrupt request register input of the PIC if a value in the interrupt request register of the PIC transitions from a logic low state to a logic high state, and then returns to the logic low state.
    • 通过模拟来自PCMCIA控制器的中断请求,然后评估PIC中断请求寄存器中包含的值,确定PCMCIA控制器与可编程中断控制器(PIC)之间的连接的系统。 响应于在可编程中断控制器的一个中断请求寄存器输入端接收到模拟中断请求,存储中断请求关联记录。 中断请求关联记录将所选择的中断请求线分配给接收到中断请求信号的中断请求寄存器输入。 如果PIC的中断请求寄存器中的值从逻辑低电平状态转换到逻辑高电平状态,则从PCMCIA控制器输出的中断请求被认为连接到PIC的特定中断请求寄存器输入,然后返回 逻辑低电平状态。
    • 10. 发明授权
    • Determining program update availability via set intersection over a
sub-optical pathway
    • 通过次优路径设置交叉点确定程序更新的可用性
    • US6151708A
    • 2000-11-21
    • US994594
    • 1997-12-19
    • Raymond D. PedrizettiScott D. QuinnTimothy W. Bragg
    • Raymond D. PedrizettiScott D. QuinnTimothy W. Bragg
    • G06F9/445G06F9/45
    • G06F8/65
    • A set of software programs on a client computer is compared against a set of updates on a server computer to determine which updates are applicable and should be transferred from the server to the client. If the link between the client and server is slow, the listing of available updates must be represented in compact form. A many-to-one mapping function (e.g. a hash function) is applied to update identifiers to generate a table of single bit entries indicating the presence of particular updates on the server. This table is transferred to the client over the slow link. At the client, the same mapping function is applied to program identifiers, and corresponding entries of the transferred table are checked to determine whether the server has a potential update. If such a potential update is noted, a second transmission is requested by the client from the server--this one conveying additional data by which hash collisions can be identified by the client and disregarded. If availability of an actual update (versus a hash collision) is thereby confirmed, the client requests a third transmission from the server--this one conveying the actual update data. By this arrangement, optimized use is made of the low bandwidth link, with successively more information transferred as the likelihood of an applicable update is successively increased. (The same arrangement can be employed in reverse, with the bit table generated at the client and identifying program files available for possible updating, transferred to the server, etc.).
    • 将客户端计算机上的一组软件程序与服务器计算机上的一组更新进行比较,以确定哪些更新是可应用的,并应从服务器传输到客户端。 如果客户端和服务器之间的链接速度较慢,则必须以紧凑的形式表示可用更新的列表。 应用多对一映射函数(例如散列函数)来更新标识符以生成指示在服务器上存在特定更新的单个位条目的表。 该表通过慢速链接传输到客户端。 在客户端,将相同的映射函数应用于程序标识符,并检查传输表的相应条目以确定服务器是否具有潜在的更新。 如果这样的潜在更新被注意到,客户端从服务器请求第二传输 - 这一个传送附加数据,通过该附加数据可以由客户端识别哈希冲突并被忽略。 如果由此确认了实际更新的可用性(相对于散列冲突),则客户机从服务器请求第三次传输 - 这是传送实际更新数据的传输。 通过这种安排,优化使用低带宽链路,随着连续更多的信息被传送,因为适用的更新的可能性被连续增加。 (相同的布置可以反过来使用,客户端产生的位表和识别可用于更新的程序文件,传输到服务器等)。