text:
|Publication number
|Publication type
|Application number
|Publication date
|May 13, 2008
|Filing date
|Jun 30, 2004
|Priority date
|Jun 30, 2004
|Fee status
|Publication number
|Jeffrey S. Brooks, Paul J. Jordan, Rabin A. Sugumar
|Original Assignee
|Sun Microsystems, Inc.
|Export Citation
|BiBTeX, EndNote, RefMan
|Patent Citations (70), Non-Patent Citations (22), Referenced by (6), Classifications (16), Legal Events (4)
|External Links: USPTO, USPTO Assignment, Espacenet
1. Field of the Invention
This invention relates to processors and, more particularly, to predicting floating-point exceptions within processors.
2. Description of the Related Art
In some pipelined processor embodiments implementing a given instruction set architecture (ISA), different instructions may be configured to execute with different latencies. For example, certain integer instructions may be configured to execute in an integer pipeline of a particular depth (i.e., a particular number of pipeline stages), while certain floating-point instructions may be configured to execute in a floating-point pipeline that is deeper than the integer pipeline. In some such embodiments, an exception condition for a longer-latency instruction may not be detected until late in the pipeline. This may create an exception hazard, in that a shorter-latency instruction issued after the longer-latency instruction may be able to complete execution and to modify architectural state before the exception caused by the longer-latency instruction is detected. Such an exception hazard may not be consistent with a precise exception model.
In some embodiments, this exception hazard may be avoided by preventing the issue of shorter-latency instructions for a number of execution cycles following the issue of a longer-latency instruction, where the number of cycles of delay is sufficient to ensure that the shorter-latency instruction will not modify architectural state until the exception condition for the longer-latency instruction has been detected. However, this solution penalizes every shorter-latency instruction regardless of whether an exception is actually generated for a given longer-latency instruction, and may unacceptably degrade processor performance.
Alternatively, the exception hazard may be avoided in some embodiments by equalizing the depth of the shorter-latency and longer-latency execution pipelines. However, this solution may substantially increase the design complexity of the processor. For example, to avoid stalling instruction issue due to dependencies on previously-issued instructions, result bypassing from each relevant pipeline stage prior to the result writeback stage may be employed. As the number of pipeline stages prior to writeback increases, the number of bypass sources also increases, which in turn requires additional die area to route and multiplex the bypass sources.
Various embodiments of an apparatus and method for floating point exception prediction and recovery are disclosed. In one embodiment, a processor may include instruction fetch logic configured to issue a first instruction from one of a plurality of threads and to successively issue a second instruction from another one of the plurality of threads. The processor may also include floating-point arithmetic logic configured to execute a floating-point instruction issued by the instruction fetch logic from a given one of the plurality of threads, and further configured to determine whether the floating-point instruction generates an exception, and may further include exception prediction logic configured to predict whether the floating-point instruction will generate the exception, where the prediction occurs before the floating-point arithmetic logic determines whether the floating-point instruction generates the exception.
In one specific implementation of the processor, one or more instructions from the given thread that are subsequent in program order to said floating-point instruction may be flushed from the processor in response to the exception prediction logic predicting that the floating-point instruction will generate the exception. In another specific implementation of the processor, an instruction from a thread other than the given thread may continue to execute while the one or more instructions from the given thread are flushed.
A method is further contemplated that in one embodiment may include the steps of issuing a first instruction from one of a plurality of threads and successively issuing a second instruction from another one of the plurality of threads, determining whether a floating-point instruction issued from a given one of the plurality of threads generates an exception, and predicting whether the floating-point instruction will generate the exception, where the exception prediction occurs before the exception determination.
While the invention is susceptible to various modifications and alternative forms, specific embodiments thereof are shown by way of example in the drawings and will herein be described in detail. It should be understood, however, that the drawings and detailed description thereto are not intended to limit the invention to the particular form disclosed, but on the contrary, the intention is to cover all modifications, equivalents and alternatives falling within the spirit and scope of the present invention as defined by the appended claims.
Overview of Multithreaded Processor Architecture
A block diagram illustrating one embodiment of a multithreaded processor 10 is shown in
Cores 100 may be configured to execute instructions and to process data according to a particular instruction set architecture (ISA). In one embodiment, cores 100 may be configured to implement the SPARC� V9 ISA, although in other embodiments it is contemplated that any desired ISA may be employed, such as x86, PowerPC� or MIPS�, for example. In the illustrated embodiment, each of cores 100 may be configured to operate independently of the others, such that all cores 100 may execute in parallel. Additionally, as described below in conjunction with the descriptions of
Crossbar 110 may be configured to manage data flow between cores 100 and the shared L2 cache 120. In one embodiment, crossbar 110 may include logic (such as multiplexers or a switch fabric, for example) that allows any core 100 to access any bank of L2 cache 120, and that conversely allows data to be returned from any L2 bank to any core 100. Crossbar 110 may be configured to concurrently process data requests from cores 100 to L2 cache 120 as well as data responses from L2 cache 120 to cores 100. In some embodiments, crossbar 110 may include logic to queue data requests and/or responses, such that requests and responses may not block other activity while waiting for service. Additionally, in one embodiment crossbar 110 may be configured to arbitrate conflicts that may occur when multiple cores 100 attempt to access a single bank of L2 cache 120 or vice versa.
L2 cache 120 may be configured to cache instructions and data for use by cores 100. In the illustrated embodiment, L2 cache 120 may be organized into eight separately addressable banks that may each be independently accessed, such that in the absence of conflicts, each bank may concurrently return data to a respective core 100. In some embodiments, each individual bank may be implemented using set-associative or direct-mapped techniques. For example, in one embodiment, L2 cache 120 may be a 4 megabyte (MB) cache, where each 512 kilobyte (KB) bank is 16-way set associative with a 64-byte line size, although other cache sizes and geometries are possible and contemplated. L2 cache 120 may be implemented in some embodiments as a writeback cache in which written (dirty) data may not be written to system memory until a corresponding cache line is evicted.
In some embodiments, L2 cache 120 may implement queues for requests arriving from and results to be sent to crossbar 110. Additionally, in some embodiments L2 cache 120 may implement a fill buffer configured to store fill data arriving from memory interface 130, a writeback buffer configured to store dirty evicted data to be written to memory, and/or a miss buffer configured to store L2 cache accesses that cannot be processed as simple cache hits (e.g., L2 cache misses, cache accesses matching older misses, accesses such as atomic operations that may require multiple cache accesses, etc.). L2 cache 120 may variously be implemented as single-ported or multiported (i.e., capable of processing multiple concurrent read and/or write accesses). In either case, L2 cache 120 may implement arbitration logic to prioritize cache access among various cache read and write requesters.
Memory interface 130 may be configured to manage the transfer of data between L2 cache 120 and system memory, for example in response to L2 fill requests and data evictions. In some embodiments, multiple instances of memory interface 130 may be implemented, with each instance configured to control a respective bank of system memory. Memory interface 130 may be configured to interface to any suitable type of system memory, such as Fully Buffered Dual Inline Memory Module (FB-DIMM), Double Data Rate or Double Data Rate 2 Synchronous Dynamic Random Access Memory (DDR/DDR2 SDRAM), or Rambus� DRAM (RDRAM�), for example. In some embodiments, memory interface 130 may be configured to support interfacing to multiple different types of system memory.
In the illustrated embodiment, processor 10 may also be configured to receive data from sources other than system memory. I/O interface 140 may be configured to provide a central interface for such sources to exchange data with cores 100 and/or L2 cache 120 via crossbar 110. In some embodiments, I/O interface 140 may be configured to coordinate Direct Memory Access (DMA) transfers of data between network interface 160 or peripheral interface 150 and system memory via memory interface 130. In addition to coordinating access between crossbar 110 and other interface logic, in one embodiment I/O interface 140 may be configured to couple processor 10 to external boot and/or service devices. For example, initialization and startup of processor 10 may be controlled by an external device (such as, e.g., a Field Programmable Gate Array (FPGA)) that may be configured to provide an implementation- or system-specific sequence of boot instructions and data. Such a boot sequence may, for example, coordinate reset testing, initialization of peripheral devices and initial execution of processor 10, before the boot process proceeds to load data from a disk or network device. Additionally, in some embodiments such an external device may be configured to place processor 10 in a debug, diagnostic, or other type of service mode upon request.
Peripheral interface 150 may be configured to coordinate data transfer between processor 10 and one or more peripheral devices. Such peripheral devices may include, without limitation, storage devices (e.g., magnetic or optical media-based storage devices including hard drives, tape drives, CD drives, DVD drives, etc.), display devices (e.g., graphics subsystems), multimedia devices (e.g., audio processing subsystems), or any other suitable type of peripheral device. In one embodiment, peripheral interface 150 may implement one or more instances of an interface such as Peripheral Component Interface Express (PCI Express™), although it is contemplated that any suitable interface standard or combination of standards may be employed. For example, in some embodiments peripheral interface 150 may be configured to implement a version of Universal Serial Bus (USB) protocol or IEEE 1394 (Firewire�) protocol in addition to or instead of PCI Express™.
Network interface 160 may be configured to coordinate data transfer between processor 10 and one or more devices (e.g., other computer systems) coupled to processor 10 via a network. In one embodiment, network interface 160 may be configured to perform the data processing necessary to implement an Ethernet (IEEE 802.3) networking standard such as Gigabit Ethernet or 10-Gigabit Ethernet, for example, although it is contemplated that any suitable networking standard may be implemented. In some embodiments, network interface 160 may be configured to implement multiple discrete network interface ports.
Overview of Fine-Grained Multithreading Processor Core
As mentioned above, in one embodiment each of cores 100 may be configured for multithreaded execution. More specifically, in one embodiment each of cores 100 may be configured to perform fine-grained multithreading, in which each core may select instructions to execute from among a pool of instructions corresponding to multiple threads, such that instructions from different threads may be scheduled to execute adjacently. For example, in a pipelined embodiment of core 100 employing fine-grained multithreading, instructions from different threads may occupy adjacent pipeline stages, such that instructions from several threads may be in various stages of execution during a given core processing cycle.
One embodiment of core 100 configured to perform fine-grained multithreading is illustrated in
Instruction fetch unit 200 may be configured to provide instructions to the rest of core 100 for execution. In the illustrated embodiment, IFU 200 includes a fetch unit 202, an instruction pick unit 206, and a decode unit 208. Fetch unit 202 further includes an instruction cache 204. In one embodiment, fetch unit 202 may include logic to maintain fetch addresses (e.g., derived from program counters) corresponding to each thread being executed by core 100, and to coordinate the retrieval of instructions from instruction cache 204 according to those fetch addresses. In some embodiments, instruction cache 202 may include fewer access ports than the number of threads executable on core 100, in which case fetch unit 202 may implement arbitration logic configured to select one or more threads for instruction fetch during a given execution cycle. For example, fetch unit 202 may implement a least-recently-fetched algorithm to select a thread to fetch. Fetch unit 202 may also implement logic to handle instruction cache misses and translation of virtual instruction fetch addresses to physical addresses (e.g., fetch unit 202 may include an Instruction Translation Lookaside Buffer (ITLB)). Additionally, in some embodiments fetch unit 202 may include logic to predict branch outcomes and/or fetch target addresses, such as a Branch History Table (BHT), Branch Target Buffer (BTB), or other suitable structure, for example.
In one embodiment, fetch unit 202 may be configured to maintain a pool of fetched, ready-for-issue instructions drawn from among each of the threads being executed by core 100. For example, fetch unit 202 may implement a respective instruction buffer corresponding to each thread in which several recently-fetched instructions from the corresponding thread may be stored. In one embodiment, instruction pick unit 206 may be configured to select one or more instructions to be decoded and issued to execution units 210. In the illustrated embodiment, the threads fetched by fetch unit 202 may be divided into two thread groups denoted TG0 and TG1 (for example, if core 100 implements eight threads, each of TG0 and TG1 may include four threads).
Pick unit 206, in the illustrated embodiment, may be configured to attempt to select one instruction to schedule for execution from each of TG0 and TG1, such that two instructions may be selected for execution during a given execution cycle. For example, pick unit 206 may employ a least-recently-picked (LRP) algorithm in which the least recently picked thread within a given thread group that is ready for execution is selected. It is noted that in one embodiment, thread fetching as performed by fetch unit 202 and instruction selection as performed by pick unit 206 may be largely independent of one another. In some embodiments, pick unit 206 may schedule instructions before all factors affecting instruction scheduling are known (e.g., instruction dependencies, implementation-specific resource hazards, etc.), in which case a picked instruction may be canceled at a later execution stage. In other embodiments, it is contemplated that other instruction selection algorithms may be employed, including algorithms that take additional instruction scheduling factors into account. Further, it is contemplated that in some embodiments, pick unit 206 may be configured to select more than two instructions for execution in a given execution cycle, or may select instructions from all threads rather than specific groups of threads. Additionally, in one embodiment pick unit 206 may be configured to identify source operand dependencies that a given picked instruction may have on a previously issued instruction, and may configure other logic to appropriately select source operands (e.g., from a register file, or from a previous execution cycle via bypass logic).
Decode unit 208 may be configured to further prepare instructions selected by pick unit 206 for execution. In the illustrated embodiment, decode unit 208 may be configured to identify the specific type of a given instruction, such as whether the instruction is an integer, floating point, load/store, or other type of instruction, as well as to identify operands required by the given instruction. Additionally, in one embodiment decode unit 208 may be configured to detect and respond to scheduling hazards not detected during operation of pick unit 206. For example, in the illustrated embodiment, only one load store unit 230 is provided. Consequently, if two load/store-type instructions were picked for execution, decode unit 208 may be configured to cancel or stall one of those instructions and allow the other to be issued. In such an embodiment, decode unit 208 may employ an arbitration algorithm to determine which instruction to issue without favoring a particular thread or thread group. Numerous other types of scheduling and resource hazards detectable by decode unit 208 are possible and contemplated.
In some embodiments, instructions from a given thread may be speculatively issued from decode unit 208 for execution. For example, a given instruction from a certain thread may fall in the shadow of a conditional branch instruction from that same thread that was predicted to be taken or not-taken, or a load instruction from that same thread that was predicted to hit in data cache 235, but for which the actual outcome has not yet been determined. In such embodiments, after receiving notice of a misspeculation such as a branch misprediction or a load miss, IFU 200 may be configured to cancel misspeculated instructions from a given thread as well as issued instructions from the given thread that are dependent on or subsequent to the misspeculated instruction, and to redirect instruction fetch appropriately.
Execution units 210 a-b may be configured to execute and provide results for certain types of instructions issued from IFU 200. In one embodiment, each of EXUs 210 may be similarly or identically configured to execute certain integer-type instructions defined in the implemented ISA, such as arithmetic, logical, and shift instructions. In the illustrated embodiment, EXU0 210 a may be configured to execute integer instructions issued from TG0, while EXU1 210 b may be configured to execute integer instructions issued from TG1. Further, each of EXUs 210 may include an integer register file configured to store register state information for all threads in its respective thread group. For example, if core 100 implements eight threads 0-7 where threads 0-3 are bound to TG0 and threads 4-7 are bound to TG1, EXU0 210 a may store integer register state for each of threads 0-3 while EXU1 210 b may store integer register state for each of threads 4-7. It is contemplated that in some embodiments, core 100 may include more or fewer than two EXUs 210, and EXUs 210 may or may not be symmetric in functionality. Also, in some embodiments EXUs 210 may not be bound to specific thread groups or may be differently bound than just described. Finally, in the illustrated embodiment instructions destined for FGU 220 or LSU 230 pass through one of EXUs 210. However, in alternative embodiments it is contemplated that such instructions may be issued directly from IFU 200 to their respective units without passing through one of EXUs 210.
Floating point/graphics unit 220 may be configured to execute and provide results for certain floating-point and graphics-oriented instructions defined in the implemented ISA. For example, in one embodiment FGU 220 may implement single- and double-precision floating-point arithmetic instructions compliant with the IEEE 754 floating-point standard, such as add, subtract, multiply, divide, and certain transcendental functions. Also, in one embodiment FGU 220 may implement partitioned-arithmetic and graphics-oriented instructions defined by a version of the SPARC� Visual Instruction Set (VIS™) architecture, such as VIS™ 2.0. Additionally, in one embodiment FGU 220 may implement certain integer instructions such as integer multiply, divide, and population count instructions, and may be configured to perform multiplication operations on behalf of stream processing unit 240. Depending on the implementation of FGU 220, some instructions (e.g., some transcendental or extended-precision instructions) or instruction operand or result scenarios (e.g., certain denormal operands or expected results) may be trapped and handled or emulated by software.
In the illustrated embodiment, FGU 220 may be configured to store floating-point register state information for each thread in a floating-point register file. In one embodiment, FGU 220 may implement separate execution pipelines for floating point add/multiply, divide/square root, and graphics operations, while in other embodiments the instructions implemented by FGU 220 may be differently partitioned. In various embodiments, instructions implemented by FGU 220 may be fully pipelined (i.e., FGU 220 may be capable of starting one new instruction per execution cycle), partially pipelined, or may block issue until complete, depending on the instruction type. For example, in one embodiment floating-point add operations may be fully pipelined, while floating-point divide operations may block other divide/square root operations until completed.
Load store unit 230 may be configured to process data memory references, such as integer and floating-point load and store instructions as well as memory requests that may originate from stream processing unit 240. In some embodiments, LSU 230 may also be configured to assist in the processing of instruction cache 204 misses originating from IFU 200. LSU 230 may include a data cache 235 as well as logic configured to detect cache misses and to responsively request data from L2 cache 120 via crossbar interface 260. In one embodiment, data cache 235 may be configured as a write-through cache in which all stores are written to L2 cache 120 regardless of whether they hit in data cache 235; in some such embodiments, stores that miss in data cache 235 may cause an entry corresponding to the store data to be allocated within the cache. In other embodiments, data cache 235 may be implemented as a write-back cache.
In one embodiment, LSU 230 may include a miss queue configured to store records of pending memory accesses that have missed in data cache 235 such that additional memory accesses targeting memory addresses for which a miss is pending may not generate additional L2 cache request traffic. In the illustrated embodiment, address generation for a load/store instruction may be performed by one of EXUs 210. Depending on the addressing mode specified by the instruction, one of EXUs 210 may perform arithmetic (such as adding an index value to a base value, for example) to yield the desired address. Additionally, in some embodiments LSU 230 may include logic configured to translate virtual data addresses generated by EXUs 210 to physical addresses, such as a Data Translation Lookaside Buffer (DTLB).
Stream processing unit 240 may be configured to implement one or more specific data processing algorithms in hardware. For example, SPU 240 may include logic configured to support encryption/decryption algorithms such as Advanced Encryption Standard (AES), Data Encryption Standard/Triple Data Encryption Standard (DES/3DES), or Ron's Code #4 (RC4). SPU 240 may also include logic to implement hash or checksum algorithms such as Secure Hash Algorithm (SHA-1, SHA-256), Message Digest 5 (MD5), or Cyclic Redundancy Checksum (CRC). SPU 240 may also be configured to implement modular arithmetic such as modular multiplication, reduction and exponentiation. In one embodiment, SPU 240 may be configured to utilize the multiply array included in FGU 220 for modular multiplication. In various embodiments, SPU 240 may implement several of the aforementioned algorithms as well as other algorithms not specifically described.
SPU 240 may be configured to execute as a coprocessor independent of integer or floating-point instruction execution. For example, in one embodiment SPU 240 may be configured to receive operations and operands via control registers accessible via software; in the illustrated embodiment SPU 240 may access such control registers via LSU 230. In another embodiment SPU 240 may receive operations and operands decoded and issued from the instruction stream by IFU 200. In some embodiments, SPU 240 may be configured to freely schedule operations across its various algorithmic subunits independent of other functional unit activity. Additionally, SPU 240 may be configured to generate memory load and store activity. In the illustrated embodiment, SPU 240 may interact directly with crossbar interface 260 for such memory activity, while in other embodiments SPU 240 may coordinate memory activity through LSU 230. In one embodiment, software may poll SPU 240 through one or more control registers to determine result status and to retrieve ready results, for example by accessing additional control registers. In other embodiments, FGU 220, LSU 230 or other logic may be configured to poll SPU 240 at intervals to determine whether it has ready results to write back. In still other embodiments, SPU 240 may be configured to generate a trap when a result is ready, to allow software to coordinate result retrieval and processing.
As previously described, instruction and data memory accesses may involve translating virtual addresses to physical addresses. In one embodiment, such translation may occur on a page level of granularity, where a certain number of address bits comprise an offset into a given page of addresses, and the remaining address bits comprise a page number. For example, in an embodiment employing 4 MB pages, a 64-bit virtual address and a 40-bit physical address, 22 address bits (corresponding to 4 MB of address space, and typically the least significant address bits) may constitute the page offset. The remaining 42 bits of the virtual address may correspond to the virtual page number of that address, and the remaining 18 bits of the physical address may correspond to the physical page number of that address. In such an embodiment, virtual to physical address translation may occur by mapping a virtual page number to a particular physical page number, leaving the page offset unmodified.
Such translation mappings may be stored in an ITLB or a DTLB for rapid translation of virtual addresses during lookup of instruction cache 204 or data cache 235. In the event no translation for a given virtual page number is found in the appropriate TLB, memory management unit 250 may be configured to provide a translation. In one embodiment, MMU 250 may be configured to manage one or more translation tables stored in system memory and to traverse such tables (which in some embodiments may be hierarchically organized) in response to a request for an address translation, such as from an ITLB or DTLB miss. (Such a traversal may also be referred to as a page table walk.) In some embodiments, if MMU 250 is unable to derive a valid address translation, for example if one of the memory pages including a necessary page table is not resident in physical memory (i.e., a page miss), MMU 250 may be configured to generate a trap to allow a memory management software routine to handle the translation. It is contemplated that in various embodiments, any desirable page size may be employed. Further, in some embodiments multiple page sizes may be concurrently supported.
A number of functional units in the illustrated embodiment of core 100 may be configured to generate off-core memory or I/O requests. For example, IFU 200 or LSU 230 may generate access requests to L2 cache 120 in response to their respective cache misses. SPU 240 may be configured to generate its own load and store requests independent of LSU 230, and MMU 250 may be configured to generate memory requests while executing a page table walk. Other types of off-core access requests are possible and contemplated. In the illustrated embodiment, crossbar interface 260 may be configured to provide a centralized interface to the port of crossbar 110 associated with a particular core 100, on behalf of the various functional units that may generate accesses that traverse crossbar 110. In one embodiment, crossbar interface 260 may be configured to maintain queues of pending crossbar requests and to arbitrate among pending requests to determine which request or requests may be conveyed to crossbar 110 during a given execution cycle. For example, crossbar interface 260 may implement a least-recently-used or other algorithm to arbitrate among crossbar requesters. In one embodiment, crossbar interface 260 may also be configured to receive data returned via crossbar 110, such as from L2 cache 120 or I/O interface 140, and to direct such data to the appropriate functional unit (e.g., data cache 235 for a data cache fill due to miss). In other embodiments, data returning from crossbar 110 may be processed externally to crossbar interface 260.
During the course of operation of some embodiments of core 100, exceptional events may occur. For example, an instruction from a given thread that is picked for execution by pick unit 206 may be not be a valid instruction for the ISA implemented by core 100 (e.g., the instruction may have an illegal opcode), a floating-point instruction may produce a result that requires further processing in software, MMU 250 may not be able to complete a page table walk due to a page miss, a hardware error (such as uncorrectable data corruption in a cache or register file) may be detected, or any of numerous other possible architecturally-defined or implementation-specific exceptional events may occur. In one embodiment, trap logic unit 270 may be configured to manage the handling of such events. For example, TLU 270 may be configured to receive notification of an exceptional event occurring during execution of a particular thread, and to cause execution control of that thread to vector to a supervisor-mode software handler (i.e., a trap handler) corresponding to the detected event. Such handlers may include, for example, an illegal opcode trap handler configured to return an error status indication to an application associated with the trapping thread and possibly terminate the application, a floating-point trap handler configured to fix up an inexact result, etc.
In one embodiment, TLU 270 may be configured to flush all instructions from the trapping thread from any stage of processing within core 100, without disrupting the execution of other, non-trapping threads. In some embodiments, when a specific instruction from a given thread causes a trap (as opposed to a trap-causing condition independent of instruction execution, such as a hardware interrupt request), TLU 270 may implement such traps as precise traps. That is, TLU 270 may ensure that all instructions from the given thread that occur before the trapping instruction (in program order) complete and update architectural state, while no instructions from the given thread that occur after the trapping instruction (in program order) complete or update architectural state.
Exemplary Core Pipeline Diagram
In the illustrated embodiment, core 100 may be configured for pipelined execution, in which processing of new instructions may begin before older instructions have completed, such that multiple instructions from various threads may be in various stages of processing during a given core execution cycle. A pipeline diagram illustrating the flow of integer instructions through one embodiment of core 100 is shown in
The first four stages of the illustrated integer pipeline may generally correspond to the functioning of IFU 200. In one embodiment, during the Fetch stage, one or more threads to fetch may be selected, and instruction cache 204 may be accessed for the selected thread. During the Cache stage, fetch unit 202 may determine whether the access of the previous cycle hit or missed the cache. If the access hit, the instructions read from the cache may be stored in instruction buffers. During the Pick stage, pick unit 206 may be configured in one embodiment to select at most two instructions to issue, one for each thread group as described above. Source dependencies of the selected instructions on previously issued instructions may also be detected during the Pick stage. During the Decode stage, decode unit 208 may be configured to decode the selected instructions and to determine whether resource hazards exist as described above. For integer operations, data operands may also be selected during the Decode stage. For example, operands may be retrieved from an integer register file, or bypass logic may be configured to bypass operands from another pipe stage.
During the Execute stage, one or both of execution units 210 may be active to compute an instruction result. If an instruction in the integer execution pipeline is not a load or store instruction, in the illustrated embodiment it may be idle during the Memory and Bypass stages before its result is committed (i.e., written back to the integer register file) in the Writeback stage. A load or store instruction may have its address calculated by one of execution units 210 during the Execute stage. During the Memory stage of a load instruction, data cache 235 may be accessed, while during the Bypass stage, LSU 230 may determine whether a data cache hit or miss occurred. In the hit case, data may be forwarded to the appropriate execution unit 210 (e.g., dependent on the thread group of the load instruction) to be committed during the Writeback stage. In one embodiment, store instructions and load instructions that miss data cache 235 may execute with different pipeline timing than shown in
In the illustrated embodiment, integer instructions are depicted as executing back-to-back in the pipeline without stalls. In execution cycles 0 through 7, instructions from threads 0, 3, 6, 2, 7, 5, 1 and 4 enter the Fetch stage, respectively, though in other embodiments, instructions may issue from various threads in a different order according to the operation of pick unit 206. In some instances, other instructions issued prior to execution cycle 0 may also be in the pipeline. Additionally, in some embodiments, two different instructions from the same or different threads may execute during the same pipeline stage. For example, in the illustrated embodiment of core 100, one integer instruction may be issued to each of execution units 210 in a single cycle.
By execution cycle 7, it is noted that each stage of the pipeline holds an instruction from a different thread in a different stage of execution, in contrast to conventional processor implementations that typically require a pipeline flush when switching between threads or processes. In some embodiments, flushes and stalls due to resource conflicts or other scheduling hazards may cause some pipeline stages to have no instruction during a given cycle. However, in the fine-grained multithreaded processor implementation employed by the illustrated embodiment of core 100, such flushes and stalls may be directed to a single thread in the pipeline, leaving other threads undisturbed. Additionally, even if one thread being processed by core 100 stalls for a significant length of time (for example, due to an L2 cache miss), instructions from another thread may be readily selected for issue, thus increasing overall thread processing throughput.
Floating-Point Exception Hazards
In some embodiments of core 100, floating-point instructions may be configured to execute in a longer pipeline than other instructions, such as integer instructions. For example, due to the complexity involved in processing floating-point exponents and mantissas, including rounding and normalization, as well as due to the larger size of, e.g., double-precision data values, additional execution pipeline stages may be added to FGU 220 to facilitate implementation.
A pipeline illustrating the flow of integer and floating-point instructions through one embodiment of core 100 is shown in
In some embodiments, execution of certain floating-point instructions may result in a floating-point exception being generated. For example, in an embodiment where FGU 220 implements IEEE 754-compliant floating-point arithmetic, certain types of instructions may generate exceptions due to receiving one or more invalid source operands, division by zero, result overflow or underflow, or loss of numerical precision (i.e., inexact result). Additionally, in some embodiments, additional exception-generating scenarios may be defined. For example, in one embodiment an instruction having denormal source operands or a denormal result may cause an exception to allow software to finish processing the instruction. It is contemplated that other types of exceptions may be defined in other embodiments.
Generally speaking, when an exception is generated, a software trap may occur. That is, execution of the thread for which an exception is generated may be interrupted, and execution may be vectored to a software trap handler corresponding to the generated exception. Such a mechanism may enable software to respond to exceptions in a program-defined manner. However, it is contemplated that in some embodiments, whether a generated exception results in a software trap may be enabled or disabled on an individual or group basis. For example, in one embodiment a global floating-point trap enable configurable by software may be provided, such that no traps due to floating-point exceptions are generated if the global enable is deasserted. Additionally, in one embodiment certain individual exceptions (such as invalid operand, divide-by-zero, overflow, and inexact, for example) may have corresponding software-configurable trap enables, such that traps corresponding to certain types of exceptions may be generated while other traps may be suppressed depending on the state of the individual exception enables.
Depending on the implementation of FGU 220, determining whether a given floating-point instruction generates an exception may occur relatively late in the execution pipeline. For example, exception determination based on a result (e.g., result overflow or underflow) may not be determined until the result is complete following the final floating-point execution stage. In the illustrated embodiment, floating-point exception status for a given instruction may not be definitively known until that instruction is in the Float Bypass stage, although in other embodiments exception status may be known earlier or later.
In some embodiments, when exceptions caused by instruction execution are generated and a corresponding trap occurs, the exception-causing instruction and subsequent instructions (in program order) in any execution pipeline that are from the same thread as the exception-causing instruction may be flushed. Such flushing may facilitate the implementation of precise exceptions, as described above. However, in some embodiments where execution pipelines are of different lengths and exception status is not known until late in the pipeline, an exception hazard may exist in which an instruction subsequent to an exception-causing instruction may modify architectural state before the exception is known. For example, referring to
Exception Prediction
In some embodiments, core 100 may be configured to predict whether a given floating-point instruction will cause an exception before that instruction's exception status is determined, and to responsively modify instruction execution behavior. One such embodiment is illustrated in
FP arithmetic logic 520 may be configured to execute floating-point instructions. In various embodiments, FP arithmetic logic 520 may include functionality such as adder logic, multiplier logic, normalization logic and/or rounding logic. In some embodiments, FP arithmetic logic 520 may include additional logic to perform division, square root, transcendental and/or other types of operations, such as graphics-oriented operations, for example. In one embodiment, FP arithmetic logic 520 may be configured to implement certain functions, such as add and multiply, in a different pipeline than other functions, such as divide and square root. In the illustrated embodiment, FP arithmetic logic 520 may be configured to determine whether a given floating-point instruction does or does not generate an exception. For example, FP arithmetic logic 520 may determine and report a given floating-point instruction's exception status during the instruction's Float Bypass execution stage.
Exception prediction logic 510 may be configured to predict whether a given floating-point instruction will generate an exception before FP arithmetic logic 520 has determined whether the given instruction generates an exception. In one embodiment, exception prediction logic 510 may be configured to predict whether a given floating-point instruction will generate an exception during the instruction's FX1 execution stage, although in other embodiments exception prediction may occur in a different execution stage. In one embodiment, exception prediction logic 510 may be configured to guarantee that if any floating-point exception can possibly occur as a result of executing a given floating-point instruction, an exception prediction (i.e., a prediction that an exception will occur) will be generated during the appropriate execution stage. However, exception prediction logic 510 may or may not be configured to guarantee that no exception prediction will be generated in the case that no exception is ultimately generated. That is, in such an embodiment exception prediction logic 510 may be configured conservatively, such that all exception-generating cases are correctly predicted, and some non-exception-generating cases may or may not be correctly predicted.
Exception prediction by exception prediction logic 510 and exception generation by FP arithmetic logic 520 may be qualified by trap enable logic 530, in the illustrated embodiment. In various embodiments, trap enable logic 530 may include mask bits or registers configurable by software to selectively enable traps for all or individual exception types as described above. In one embodiment, if software trapping for a given exception is disabled by trap enable logic 530, exception prediction logic 510 may not generate an exception prediction for the disabled exception for any floating-point instruction from any thread. Also, in one such embodiment, FP arithmetic logic 520 may be configured to determine whether a given instruction generates an exception even if software trapping for that exception is disabled. However, FP arithmetic logic 520 may be configured to suppress trapping in this case. In some embodiments, FP arithmetic logic 520 may be configured to indicate exception generation by setting a bit in a status register, so that software may poll the status register to detect exception history even if trapping for that exception is disabled.
In one embodiment exception prediction logic 510 may be configured to generate exception predictions for a given floating-point instruction dependent on one or more operands of the instruction as well as the specific type of the instruction. For example, under the IEEE 754 floating-point arithmetic standard, a floating-point add instruction (FADD) may generate an invalid exception if either operand is a signaling not-a-number data type (SNaN) or if both operands are infinity data types of opposite signs, where the SNaN and infinity data types may be defined in accordance with the IEEE 754 standard. In one embodiment, exception prediction logic 510 may be configured to generate an invalid-exception prediction for an FADD instruction for which either source operand is a SNaN, or for which the source operands are positive infinity and negative infinity. In another embodiment, exception prediction logic 510 may be configured to generate an exception prediction for an FADD instruction for which either source operand is a SNaN or infinity of any sign. It is noted that the latter prediction includes all of the cases of the former prediction as well as some cases that do not generate exceptions (i.e., false-positive cases). In some embodiments, the latter prediction may be simpler to implement than the former, while the former embodiment may produce fewer false-positive exception predictions. Similar tradeoffs between implementation complexity and prediction accuracy may be made for other types of floating-point instructions.
As another example, an IEEE 754-compliant FADD instruction may generate an overflow exception if its result is too large to be represented within the result data format (e.g., single precision or double precision format). Such a case may occur only if the operands have the same sign (i.e., both positive or both negative), if at least one operand has a maximum exponent field, and if neither operand is a NaN (signaling or quiet) or infinity data type. In one embodiment, exception prediction logic 510 may be configured to generate an overflow-exception prediction for an FADD instruction for which the operands satisfy these conditions. In various embodiments, exception prediction logic 510 may be configured to predict other types of exceptions for different floating-point instructions by performing other types of operand analyses, such as by comparing operand exponent fields to each other or to constants, or by referring to other state information such as status or enable bits, for example. It is contemplated that in some embodiments, not every floating-point instruction may be architecturally defined to generate every type of floating-point exception, and some such instructions may not generate any floating-point exceptions. Correspondingly, exception prediction logic 510 may be configured not to predict irrelevant exception cases for an instruction. Also, in one embodiment certain floating-point instructions, such as divide and square root, for example, may be configured to execute in a pipeline separate from other floating-point instructions. In such an embodiment, exception prediction logic 510 may be configured to predict exceptions for instructions in one pipeline, but not the other. For example, exception prediction logic 510 may be configured not to predict divide or square-root-related exceptions.
If exception prediction logic 510 generates an exception prediction for a given floating-point instruction from a given thread, in one embodiment instructions from that given thread that are subsequent in program order to the given floating-point instruction may be flushed from the execution pipeline, regardless of whether they are integer, floating-point, or other types of instructions. In one embodiment, such flushing may include deleting any subsequent instructions that are in the Pick pipeline stage or later, although in other embodiments, subsequent instructions later than a different pipeline stage may be flushed. It is noted that in one embodiment, instructions from a thread other than the given thread may continue executing while instructions from the given thread are flushed. That is, the floating-point exception hazard may exist only between instructions from the same thread.
As noted above, in one embodiment exception prediction logic 510 may be configured to generate an exception prediction for a given floating-point instruction during that instruction's FX1 pipeline stage. In the illustrated embodiment, exception prediction logic 510 may be configured to convey the exception prediction along with a corresponding thread identifier to TLU 270 during the instruction's FX2 pipeline stage. Responsively, TLU 270 may be configured to broadcast an instruction flush for the indicated thread during the instruction's FX3 pipeline stage, which may responsively cause other units (such as IFU 200, EXUs 210 or any other unit of core 100) to void instructions in progress from the indicated thread. Referring to the pipeline diagram illustrated in
In one embodiment, the flush broadcast by TLU 270 in the FX3 pipeline stage may be configured to flush an instruction from the indicated thread in the Writeback stage one cycle later, and all instructions from the indicated thread in the Pick through Writeback stages two cycles later. In other embodiments, it is contemplated that all instructions from the indicated thread may be flushed over the course of more or fewer execution cycles. Further, the timing of the flush relative to generation of the exception prediction may vary in various embodiments, for example according to the depth of the pipeline, implementation considerations, etc.
By flushing subsequent instructions in a given thread on the basis of an exception prediction, thereby preventing the flushed instructions from modifying architectural state, the aforementioned exception hazard may be avoided. In some embodiments, however, mispredicted exceptions (i.e., exception predictions for which no exception was actually generated) may cause instructions to be unnecessarily flushed, which may reduce the performance of the given thread owing to the delay incurred as the unnecessarily flushed instructions are refetched. In one embodiment, IFU 200 may be configured to speculatively refetch one or more instructions subsequent to a given floating-point instruction in a given thread in response to an exception prediction and associated thread flush. If the exception prediction is subsequently confirmed to be correct, such as by FP arithmetic logic 520 during the Float Bypass stage, for example, the refetched instructions may be flushed and the appropriate exception trap handler fetched. If the exception prediction is disconfirmed, the refetched instructions may be allowed to proceed through the pipeline. In some embodiments, such speculative refetching may result in a shorter delay in resuming execution following a misprediction than if the refetch was postponed until the status of a given exception prediction was known.
A pipeline diagram illustrating speculative refetching following exception prediction in one embodiment of core 100 is shown in
Responsive to this flush, in the illustrated embodiment IFU 200 may be configured to immediately begin refetching the first thread 0 instruction (i.e., instruction T0_I) following the floating-point instruction for which the exception prediction was generated. For example, instruction T0_I may enter the Fetch stage (not shown in
Later in the execution pipeline, FGU 220 may be configured to determine whether or not an executing floating-point instruction generates an exception. For example, in the illustrated embodiment, FP arithmetic logic 520 may be configured to make this determination in the Float Bypass pipeline stage of instruction T0_F (execution cycle 8). If no exception is generated (i.e., the exception was mispredicted by exception prediction logic 510), instruction T0_F may be allowed to proceed to the Float Writeback stage to write back its results in execution cycle 9, and refetched instruction T0_I may be allowed to proceed through the execution pipeline. In the illustrated embodiment, refetched instruction T0_I is shown entering the Pick stage in execution cycle 10.
Alternatively, if an exception is determined to be generated (i.e., the exception was correctly predicted by exception prediction logic 510), both instruction T0_F and refetched instruction T0_I may be flushed. For example, FGU 220 may be configured to flush instruction T0_F as it enters the Float Writeback stage, preventing it from updating architectural state. Similarly, IFU 200 may be configured to flush refetched instruction T0_I, as well as any subsequent refetched instructions from the same thread. Subsequently, the fetch of the appropriate exception trap handler may be initiated. For example, TLU 270 may direct IFU 200 to begin fetching from the appropriate trap vector.
It is contemplated that in other embodiments, generation of exception predictions, reporting of predictions, flush broadcasting, and speculative refetching of instructions may occur at different pipeline stages than those illustrated, and that latencies between some such events may differ from those illustrated. For example, flush and refetch timing may vary by one or several cycles in various embodiments dependent on pipeline depth, timing concerns, etc. It is also contemplated that in one embodiment, core 100 may provide a means for disabling exception prediction and speculative refetching, such as a control bit or field in a programmable register, for example. In such an embodiment, if exception prediction is disabled, IFU 200 may be configured to stall a given thread after an instruction is issued to FGU 220 from the given thread, such that no further instructions issue from the given thread until the exception status of the issued instruction has been determined. Additionally, it is contemplated that in some embodiments, any of the aforementioned techniques of exception prediction, flushing, and speculative instruction refetching may be performed by functional units of core 100 other than those described above.
One embodiment of a method of predicting exceptions in a fine-grained multithreaded core such as core 100 is illustrated in
If no exception prediction is generated, then in the illustrated embodiment, it is guaranteed that no exception will occur for the issued floating-point instruction, and execution of the issued instruction proceeds without a pipeline flush occurring (blocks 704, 706). If an exception prediction is generated, any subsequently issued instructions from the same thread as the issued floating-point instruction are flushed from the execution pipeline (blocks 704, 708). For example, exception prediction logic 510 may convey a generated prediction to TLU 270, to be broadcast to other functional units within core 100.
In response to a flush due to an exception prediction, one or more instructions from the same thread as and subsequent to the issued floating-point are speculatively refetched (block 710), for example by IFU 200. Subsequent to the exception prediction, the exception status of the issued floating-point instruction may be determined (block 712). If the issued instruction does in fact generate the predicted exception, the issued instruction as well as any speculatively refetched instructions are flushed (blocks 714, 716) and the appropriate exception trap handler is fetched (block 718). If the issued instruction does not generate the predicted exception, the issued instruction and any subsequent speculatively refetched instructions are allowed to proceed without flushing (block 720). As noted above, in some embodiments instruction flushing and trap handler fetching in response to exception generation may be qualified by trap enable logic 530.
Exemplary System Embodiment
As described above, in some embodiments processor 10 of
In various embodiments, system memory 810 may comprise any suitable type of system memory as described above, such as FB-DIMM, DDR/DDR2 SDRAM, or RDRAM�, for example. System memory 810 may include multiple discrete banks of memory controlled by discrete memory interfaces in embodiments of processor 10 configured to provide multiple memory interfaces 130. Also, in some embodiments system memory 810 may include multiple different types of memory.
Peripheral storage device 820, in various embodiments, may include support for magnetic, optical, or solid-state storage media such as hard drives, optical disks, nonvolatile RAM devices, etc. In some embodiments, peripheral storage device 820 may include more complex storage devices such as disk arrays or storage area networks (SANs), which may be coupled to processor 10 via a standard Small Computer System Interface (SCSI), a Fibre Channel interface, a Firewire� (IEEE 1394) interface, or another suitable interface. Additionally, it is contemplated that in other embodiments, any other suitable peripheral devices may be coupled to processor 10, such as multimedia devices, graphics/display devices, standard input/output devices, etc.
As described previously, in one embodiment boot device 830 may include a device such as an FPGA or ASIC configured to coordinate initialization and boot of processor 10, such as from a power-on reset state. Additionally, in some embodiments boot device 830 may include a secondary computer system configured to allow access to administrative functions such as debug or test modes of processor 10.
Network 840 may include any suitable devices, media and/or protocol for interconnecting computer systems, such as wired or wireless Ethernet, for example. In various embodiments, network 840 may include local area networks (LANs), wide area networks (WANs), telecommunication networks, or other suitable types of networks. In some embodiments, computer system 850 may be similar to or identical in configuration to illustrated system 800, whereas in other embodiments, computer system 850 may be substantially differently configured. For example, computer system 850 may be a server system, a processor-based client system, a stateless "thin" client system, a mobile device, etc.
Although the embodiments above have been described in considerable detail, numerous variations and modifications will become apparent to those skilled in the art once the above disclosure is fully appreciated. It is intended that the following claims be interpreted to embrace all such variations and modifications.
|Cited Patent
|Filing date
|Publication date
|Aug 15, 1986
|Jul 4, 1989
|International Business Machines Corporation
|Accelerated validity response permitting early issue of instructions dependent upon outcome of floating point operations
|Feb 29, 1988
|Nov 7, 1989
|Mips Computer Systems, Inc.
|Method and apparatus for precise floating point exceptions
|Apr 18, 1989
|Sep 3, 1991
|Hitachi, Ltd.
|Multi-processor system testing method
|Oct 18, 1991
|Mar 9, 1993
|Hewlett-Packard Company
|Method and apparatus for exception handling in pipeline processors having mismatched instruction pipeline depths
|Mar 31, 1992
|Oct 26, 1993
|Intel Corporation
|Floating point and integer number conversions in a floating point adder
|Nov 29, 1993
|Aug 16, 1994
|Motorola, Inc.
|Parallel method and apparatus for detecting and completing floating point operations involving special operands
|Nov 1, 1993
|Jan 31, 1995
|Motorola, Inc.
|Floating point data processor and a method for performing a floating point square root operation within the data processor
|Mar 7, 1994
|Jan 30, 1996
|Ross Technology, Inc.
|Central processing unit architecture with symmetric instruction scheduling to achieve multiple instruction launch and execution
|Sep 8, 1995
|May 7, 1996
|Hewlett-Packard Company
|Floating point arithmetic unit using modified Newton-Raphson technique for division and square root
|May 17, 1993
|Aug 13, 1996
|Matsushita Electric Industrial Co., Ltd.
|Multistream instruction processor able to reduce interlocks by having a wait state for an instruction stream
|Jan 19, 1995
|Aug 20, 1996
|Exponential Technology, Inc.
|Floating point exception prediction for compound operations and variable precision using an intermediate exponent bus
|Oct 24, 1994
|Sep 24, 1996
|Intel Corporation
|Method and apparatus for executing floating point (FP) instruction pairs in a pipelined processor by stalling the following FP instructions in an execution stage
|Jul 5, 1995
|Apr 8, 1997
|Sun Microsystems, Inc.
|Shared hardware for multiply, divide, and square root exponent calculation
|Oct 10, 1995
|Sep 22, 1998
|Microunity Systems Engineering, Inc.
|Technique of incorporating floating point information into processor instructions
|May 30, 1997
|Feb 2, 1999
|National Semiconductor Corporation
|Integrated routing and shifting circuit and method of operation
|May 15, 1996
|Sep 21, 1999
|Sun Microsystems, Inc.
|Quotient digit selection logic for floating point division/square root
|Oct 23, 1997
|Jun 13, 2000
|International Business Machines Corporation
|Method and apparatus to force a thread switch in a multithreaded processor
|Dec 27, 1996
|Jul 11, 2000
|International Business Machines Corporation
|Background completion of instruction and associated fetch request in a multithread processor
|Feb 27, 1998
|Jul 11, 2000
|Mosaid Technologies, Incorporated
|Encryption processor with shared memory interconnect
|Aug 27, 1997
|Aug 15, 2000
|Matsushita Electric Industrial Co., Ltd.
|Multithreaded processor for processing multiple instruction streams independently of each other by flexibly controlling throughput in each instruction stream
|Mar 27, 1998
|Oct 10, 2000
|Advanced Micro Devices, Inc.
|Floating point addition pipeline configured to perform floating point-to-integer and integer-to-floating point conversion operations
|Oct 23, 1997
|Apr 3, 2001
|International Business Machines Corporation
|Altering thread priorities in a multithreaded processor
|Dec 20, 1999
|Apr 17, 2001
|Sun Microsystems, Inc.
|Apparatus for generating out-of-order results and out-of-order condition codes in a processor
|Jun 17, 1998
|Jun 5, 2001
|International Business Machines Corporation
|Cache architecture to enable accurate cache sensitivity
|Apr 30, 1998
|Aug 28, 2001
|Intel Corporation
|Method and apparatus for floating point operations and format conversion operations
|Mar 24, 1999
|Nov 13, 2001
|International Business Machines Corporation
|Control of multiple equivalent functional units for power reduction
|May 11, 1999
|Jan 22, 2002
|Sun Microsystems, Inc.
|Thread switch logic in a multiple-thread processor
|Jan 29, 1999
|Feb 19, 2002
|Sun Microsystems, Inc.
|Floating point square root and reciprocal square root computation unit in a processor
|Dec 9, 1999
|Mar 12, 2002
|Intel Corporation
|Method and apparatus for disabling a clock signal within a multithreaded processor
|Feb 6, 2001
|May 28, 2002
|Advanced Micro Devices, Inc.
|Floating point addition pipeline including extreme value, comparison and accumulate functions
|Aug 19, 1999
|Jul 2, 2002
|National Semiconductor Corporation
|Converting negative floating point numbers to integer notation without two's complement hardware
|Aug 31, 1999
|Jul 30, 2002
|Intel Corporation
|SRAM controller for parallel processor architecture including address and command queue and arbiter
|Jun 1, 2000
|Aug 13, 2002
|Mosaid Technologies Inc.
|Encryption processor with shared memory interconnect
|Oct 28, 1998
|Oct 1, 2002
|Intrinsity, Inc.
|Method and apparatus for a late pipeline enhanced floating point unit
|Mar 14, 2000
|Oct 22, 2002
|Compaq Computer Corporation
|Pipelined multi-thread processor selecting thread instruction in inter-stage buffer based on count information
|Dec 9, 1999
|Dec 17, 2002
|Intel Corporation
|Method and apparatus for processing an event occurrence within a multithreaded processor
|May 11, 1999
|Jan 14, 2003
|Sun Microsystems, Inc.
|Switching method in a multi-threaded processor
|Aug 19, 1999
|Feb 18, 2003
|National Semiconductor Corporation
|Integer to floating point conversion using one's complement with subsequent correction to eliminate two's complement in critical path
|Dec 23, 1999
|May 13, 2003
|Intel Corporation
|Microprocessor with digital power throttle
|Oct 23, 1997
|May 20, 2003
|International Business Machines Corporation
|Thread switch control in a multithreaded processor system
|Sep 3, 1999
|Jul 15, 2003
|Sun Microsystems, Inc.
|Quotient digit selection logic for floating point division/square root
|Dec 28, 1999
|Sep 23, 2003
|Intel Corporation
|Thread signaling in multi-threaded network processor
|Nov 12, 1999
|Sep 30, 2003
|International Business Machines Corporation
|Master-slave latch circuit for multithreaded processing
|Jan 12, 2001
|Sep 30, 2003
|Intel Corporation
|Solving parallel problems employing hardware multi-threading in a parallel processing environment
|Jul 30, 1999
|Oct 7, 2003
|Mips Technologies, Inc.
|Method and apparatus for predicting floating-point exceptions
|Feb 22, 2000
|Oct 14, 2003
|Hewlett-Packard Development Company, L.P.
|Apparatus and method for sharing overflow/underflow compare hardware in a floating-point multiply-accumulate (FMAC) or floating-point adder (FADD) unit
|Jun 22, 2001
|Nov 18, 2003
|Intel Corporation
|Determination of approaching instruction starvation of threads based on a plurality of conditions
|Jun 8, 2001
|Dec 23, 2003
|Hewlett-Packard Development Company, L.P.
|Scalable architecture based on single-chip multiprocessing
|Aug 31, 1999
|Dec 23, 2003
|Intel Corporation
|Microengine for parallel processor architecture
|Dec 21, 2000
|Dec 30, 2003
|Intel Corporation
|Journaling for parallel hardware threads in multithreaded processor
|Aug 15, 2000
|Jan 20, 2004
|International Business Machines Corporation
|Field protection against thread loss in a multithreaded computer processor
|Dec 7, 2000
|Feb 3, 2004
|Intel Corporation
|Low-power processor hint, such as from a PAUSE instruction
|Feb 12, 2002
|Feb 17, 2004
|Sun Microsystems, Inc.
|Switching method in a multi-threaded processor
|May 4, 2000
|Feb 17, 2004
|International Business Machines Corporation
|Selective flush of shared and other pipeline stages in a multithread processor
|Oct 23, 1997
|Feb 24, 2004
|International Business Machines Corporation
|Method and apparatus for selecting thread switch events in a multithreaded processor
|Jul 30, 2002
|Apr 27, 2004
|Intel Corporation
|SRAM controller for parallel processor architecture and method for controlling access to a RAM using read and read/write queues
|Aug 15, 2000
|Jun 8, 2004
|International Business Machines Corporation
|Changing the thread capacity of a multithreaded computer processor
|Oct 23, 2000
|Sep 7, 2004
|Arm Limited
|Method, data processing system and computer program for comparing floating point numbers
|May 23, 2002
|Oct 5, 2004
|Sun Microsystems, Inc.
|Multiple-thread processor with single-thread interface shared among threads
|Sep 22, 2000
|Nov 16, 2004
|Renesas Technology Corporation
|Square root extraction circuit and floating-point square root extraction device
|Aug 10, 2001
|Jan 25, 2005
|Lsi Logic Corporation
|Floating point divide and square root processor
|Nov 30, 2001
|Feb 15, 2005
|Intel Corporation
|Method and apparatus for processing events in a multithreaded processor
|Mar 8, 2002
|Apr 19, 2005
|Intel Corporation
|Method and apparatus for disabling a clock signal within a multithreaded processor
|Dec 9, 1999
|May 3, 2005
|Intel Corporation
|Method and apparatus for entering and exiting multiple threads within a multithreaded processor
|Jun 28, 2001
|May 24, 2005
|Intel Corporation
|High instruction fetch bandwidth in multithread processor using temporary instruction cache to deliver portion of cache line in subsequent clock cycle
|May 23, 2000
|Feb 7, 2006
|Mips Technologies, Inc.
|Floating-point processor with operating mode having improved accuracy and high performance
|Jul 25, 2002
|Nov 28, 2006
|Hewlett-Packard Development Company, L.P.
|Method and apparatus for optimizing performance in a multi-processing system
|Jun 13, 2001
|Dec 19, 2002
|Sun Microsystems, Inc.
|Flushable free register list
|Aug 13, 1999
|Feb 6, 2003
|J. Arjun Prabhu
|Exception handling for simd floating point-instructions
|Apr 8, 2002
|Mar 25, 2004
|Cornea-Hasegan Marius A.
|Methods and apparatus for predicting an underflow condition associated with a floating-point multiply-add operation
|Alverson et al., "Exploiting Heterogenous Parallelism on a Multithreaded Multiprocessor," ACM 1992, pp. 188-197.
|Alverson et al., "Tera Hardware-Software Cooperation," 16 pages.
|Alverson et al., "The Tera Computer System," ACM 1990, 6 pages.
|Baniasadi, et al., "Instruction Flow-Based Front-end Throttling for Power-Aware High Performance Processors," ACM 2001, pp. 16-21.
|Eberle, et al., "Cryptographic Processor for Arbitrary Elliptic Curves over GF(2<SUP>m</SUP>)," 11 pages.
|Gura, et al., "An End-to-End Systems Approach to Elliptic Curve Cryptography," 16 pages.
|Ide, et al., "A 320-MFLOPS CMOS Floating-Point Processing Unit for Superscalar Processors," IEEE 1993, 5 pages.
|Kalla, et al., IBM Power5 Chip: A Dual-Core Multithreaded Processor, IEEE MICRO, vol. 24, No. 2, Apr. 2004, pp. 40-47.
|Kongetira, et al., "Niagara: A 32-Way Multithreaded Sparc Processor," IEEE Micro, vol. 25, No. 2, Apr. 2005, pp. 21-29.
|Nemawarkar, et al., "Latency Tolerance: A Metric for Performance Analysis of Multithreaded Architectures," IEEE 1997, pp. 227-232.
|Smith, "The End of Architecture," May 29, 1990, pp. 10-17.
|Standards Committee of the IEEE Computer Society, "An American National Standard IEEE Standard for Binary Floating-Point Arithmetic," 1985, IEEE.
|Sun Microsystems, "Introduction to Throughput Computing," Feb. 2003, pp. 1-18.
|Sun Microsystems, "MAJC Architecture Tutorial. White Paper," Sep. 1999, pp. 1-31.
|Tullsen, et al., "Exploiting Choice: Instruction Fetch and Issue on an Implementable Simultaneous Multithreading Processor," pp. 191-202.
|Tullsen, et al., "Simultaneous Multithreading: Maximizing On-Chip Parallelism," ISCA 1995, pp. 533-544.
|Tulsen et al., "Power-sensitive multithreaded architecture," IEEE 2000, pp. 199-206.
|U.S. Appl. No. 10/880,488, filed Jun. 30, 2004.
|U.S. Appl. No. 10/881,763, filed Jun. 30, 2004.
|Uhrig et al., "Hardware-based power management for real-time applications," Proceedings of the Second International Symposium on Parallel and Distributed Computing, IEEE 2003, 8 pages.
|Uhrig, et al., "Implementing Real-Time Scheduling Within A Multithreaded Java Microcontroller," 8 pages.
|Ungerer et al., "A Survey of Processors with Explicit Multithreading," ACM Computing Surveys, vol. 35, No. 1, Mar. 2003, pp. 29-63.
|Citing Patent
|Filing date
|Publication date
|Feb 26, 2009
|Jan 8, 2013
|Microsoft Corporation
|Emulating legacy hardware using IEEE 754 compliant hardware
|Jun 30, 2011
|Feb 23, 2016
|Advanced Micro Devices, Inc.
|Flush operations in a processor
|Feb 26, 2009
|Aug 26, 2010
|Microsoft Corporation
|Emulating legacy hardware using ieee 754 compliant hardware
|Sep 3, 2010
|Mar 8, 2012
|Advanced Micro Devices, Inc.
|Method and apparatus for performing floating-point division
|Jun 30, 2011
|Jan 3, 2013
|Advanced Micro Devices, Inc.
|Flush operations in a processor
|Mar 10, 2016
|Mar 2, 2017
|Samsung Electronics Co., Ltd.
|Tininess prediction and handler engine for smooth handling of numeric underflow
|U.S. Classification
|712/244, 708/498, 712/222, 708/495
|International Classification
|Cooperative Classification
|European Classification
|Jun 30, 2004
Owner name: SUN MICROSYSTEMS, INC., CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BROOKS, JEFFREY S.;JORDAN, PAUL J.;SUGUMAR, RABIN A.;REEL/FRAME:015538/0742
Effective date: 20040617
|Sep 21, 2011
|Fee payment
Year of fee payment: 4
|Oct 28, 2015
|Fee payment
Year of fee payment: 8
|Dec 16, 2015
Owner name: ORACLE AMERICA, INC., CALIFORNIA
Free format text: MERGER AND CHANGE OF NAME;ASSIGNORS:ORACLE USA, INC.;SUN MICROSYSTEMS, INC.;ORACLE AMERICA, INC.;REEL/FRAME:037303/0025
Effective date: 20100212


text:
Ahhh! I got the best package ever today from eye_on_sparrow. I'm so spoiled, there is no way I can make something awesome enough to thank her for it!
Drumroll please:
The box after convincing one of my more manly friends to carry all 52 pounds of it up 3 flights of stairs.
Upon opening:fabricgasm!
What can only be described as an ass load of fabric.
Kits, patterns, and books.
Sewing doodads
Bunches and bunches of buttons!
And that's about it. Oh yeah, one more thing:
An f'n sewing machine!!!!!!!!!!!!!

subset: commoncrawl


text:
The NYSCA staff works hard to ensure that our grant guidelines are as thorough as possible, answering crucial questions that may come up during the application period and providing step-by-step instructions with photos to ease the process. However, we recognize that it may be useful to have a quick overview of what kinds of projects are eligible in each category, in addition to the full guidelines.
For this purpose, we have created Guidelines-at-a-Glance. Every day for the next three weeks, we will share one entry summarizing one of the 15 NYSCA Programs open for application. At the end of this period, we will also share a document compiling all the Guidelines-at-a-Glance. In addition to eligible projects listed, programs except Facilities and Individual Artists offer General Operating Support.
Today, we focus on Folk Arts:
What are Folk Arts?
Folk arts are traditional cultural expressions practiced within and among ethnic, regional, occupational and religious communities as well as other kinds of groups. They are usually learned informally through performance, by example or in oral traditions and maintained over time among families, friends, neighbors and co-workers rather than formal education. The practice of folk arts stems from birthright, community membership or direct participation in the life of a community. Never static, folk arts change as artists create innovations recognized by other community members and as traditions are adapted to new circumstances while maintaining their traditional qualities.
Program Priorities Include:
- Both projects designed to safeguard traditions within communities and programming that enable audiences to experience traditions of other cultures are supported
- Development of projects in close consultation and collaboration with the communities and artists whose traditions are to be presented. Support is not available for programming involving artists who appropriate, interpret, or revive the traditions of other communities.
- Presentations grounded in the traditional modes of practicing folk art are encouraged. The Folk Arts Program does not support programming involving choreography, theatricalization, or stylization that substantially alters traditions.
- Professional direction through folklorists, ethnomusicologists, or other appropriate staff consultants for program development, field research to document artists, interpretation and the production of presentations for general audiences.
- Interpretive practices that aid appreciation and understanding of a tradition's meaning and contexts, especially for unfamiliar art forms. These may include program booklets or other publications, websites, lecture/demonstrations, spoken introductions to performances, and/or interpretive signage to aid appreciation and understanding of a tradition's meaning and contexts.
Funding Categories Most Relevant to New Applicants:
Project Support (may include field research expenses)
Supports concerts, performances, visual arts, exhibitions, festivals, lectures, demonstrations, residencies, oral narrative programs of traditional folk arts.
Folk Arts Apprenticeships (up to $5,000; includes up to $500 in administrative costs)
- Provide individuals experienced in a folk art with opportunities to study with master folk artists from their own community
- Funding priority is for the master's fee.
- Priority is given to apprenticeships involving the transmission of traditions no longer widely practiced
Technical Assistance
- Available to any individual or organization engaged in or planning folk arts programs in New York State.
- Encompasses diverse formats for technical assistance, including both short-term and long-term consulting, visits to the consultant's organization to observe activities, and assistance for master folk artists to advise other artists. Support is provided to attend conferences and meetings in New York State, observe exemplary programs, and interact with colleagues.
- Applications are reviewed on an ongoing basis.
For technical assistance, contact: New York Folklore Society/ email@example.com/518 346-7008


text:
Free Streaming Toy in HD FormatNow you can see Toy in HD quality with duration 94 Min and has been launched in 2015-08-22 and MPAA rating is 0.
- Original Title : Toy
- Movie title in your country : Toy
- Year of movie : 2015
- Genres of movie : Romance, Thriller,
- Status of movie : Released
- Release date of movie : 2015-08-22
- Companies of movie :
- Countries of movie :
- Language of movie :
- Durationof movie : 94 Min
- Average vote of movie : 0
- Youtube ID of movie :
- Translation of movie : EN,
- Cast of movie :Briana Evigan (Chloe)
Movie summary of Toy :
Play full Toy in High Quality Video with movie synopsis "ToY is a drama about two lost souls from disparate backgrounds who find each other amid the desperation and glamour of Los Angeles, forging an unlikely relationship that spirals into tragic chaos." in top quality. Full Streaming Toy in HD Quality by clicking the button above.
Play full with title Toy full and free movie streaming in top quality. Enjoy movie with title Toy free an fun at here. These days, you is able to see that hundreds thousands of people in search of free Toy movie and watch it on their sweat house with internet connection. Become happy, you may reach thousands and thousands of content members whom became tired of waiting regarding dvds in the mail, and it's simple to watch at no cost Toy. You can obtain new online movie, and obtain it totally free in your site. It really is fast, effortless, free and furthermore to try. Play now Toy online movie without having downloading. You can view online movie streaming inside HD quality in 94 Min length. View trailer movie plus full movie of Toy go through the button below to see these movie.
... Free Toy in HD Video 1080p ...
Sure, now you can watch movie connected with Toy completely length and get the connect to this flick Toy in HD quality.
Tags: lesbian,


text:
Donations can be made to The Arc of Somerset County by either clicking here or by mailing a check made payable to: The Arc Foundation of Somerset County, 141 South Main St., Manville, NJ 08835
If you have any questions, please call our Development Office at 908-658-3805.
The Arc of Somerset County Now Listed as a Charity on AMAZON SMILE!
Do you shop on Amazon? Now those shopping trips can support The Arc of Somerset County as well. Use this unique link before adding items to your cart and 0.5% of the price of your eligible purchases will go to The Arc of Somerset County. Happy Shopping!


text:
Diendantinhyeu.org ranks
#14,287,692 in the world and generates
149 Page views for daily.
FreeWebsiteReport estimates Diendantinhyeu.org for a valuation of
$326 USD for it's visitor traffic that has the potential for CPC and Display-based advertising.
This traffic data suggests the Advertisers with a Traffic Acquisition Cost (TAC) of
$0.45 for daily and
$13.42 for monthly to spend on advertisements with Diendantinhyeu.org. Diendantinhyeu.org's page load time for
90th percentile measures at 2 sec. Diendantinhyeu.org receives most of it's
organic referrals traffic from 8 websites around the world. Diendantinhyeu.org servers are located in the United States.
|Time Average
|Site Rank
|View Rank
|Views Per-User
3 Month
Google Safe Browsing - Safe website. Clean from Viruses, Malicious Worms, Adwares, Trojans, Spywares and Suspicious Phishing Attacks.


text: Locate My Droid (LMD) is a tool to locate your android 2.x device via SMS. You can have the phone ring and or send its location back. It will try to use GPS first. If GPS is not available then wifi / cel tower location will be used. Even if your phone is muted or the volume is down it will un-mute your phone turn the volume all the way up and ring for the specified duration. There are lots of options for toggling things like saving incoming and outgoing SMS to your SMS history, sending back access denied SMS for those not in your Access Control List. You have a pass phrase for each function and an access list for contact names and numbers. You can also password protect the app. Free version is ad supported, full version unlocks the free version removing ad's and adding extra features like being able to mess with your friends by sending back a fake location when a request comes in. LMD does require allot of permissions all of which are required for all the features it offers. The Help lists the reason each permission is needed. Check out the full description and help file on my website: PAR Droid Android Apps Market link for mobile devices: market://search?q=pnamerg.par.locatemydroid


text:
JJ Evendon
A Loving Man - Poem by JJ Evendon
If your friend lets you down
and a true love can't be found,
till the blue skies come around
I'll be sitting right by your side.
So journey far and fly safe,
enjoy this world for it's a strange place
keep that smile upon your face
for when it is not I'll be right by your side.
Though there may be oceans between us now
I think about you every now and again.
No, don't forget me, now that we're apart,
just open up that great big loving heart.
Take your time to embrace romance
and teach your daughter how to sing and dance.
Love may hurt but sometimes it's worth the chance,
If not, I'll be right by your side.
I hear your laughter and cries too,
all these things I miss of you.
I wasn't perfect - this I would admit,
always trying to make the pieces fit.
Don't ask me now that the time has set
for I've loved you since the moment we first met.
So many times we have laughed and cried.
Knowing you has filled my heart with pride.
You'll always be a part of me.
Topic(s) of this poem: Love
Comments about A Loving Man by JJ Evendon
Jaya Mishra (6/17/2013 1:57:00 PM)
hats off....
If I started to repeat the lines I loved here, I guess I wud end up writing the entire poem!
Still I would point out some....
Enjoy this world for it's a strange place
Take your time to embrace romance
And teach your children how to sing and dance
Love may hurt but sometimes it's worth the chance
I loved this piece..... simply elegant!
:) (Report) Reply
Read this poem in other languages
This poem has not been translated into any other language yet.
I would like to translate this poem »
JJ Evendon's Other Poems
Famous Poems
Phenomenal Woman
Maya Angelou
Still I Rise
Maya Angelou
The Road Not Taken
Robert Frost
If You Forget Me
Pablo Neruda
Langston Hughes
Annabel Lee
Edgar Allan Poe
Caged Bird
Maya Angelou
Rudyard Kipling
Stopping By Woods On A Snowy Evening
Robert Frost
I Do Not Love You Except Because I Love You
Pablo Neruda


text:
Quick Reference
Related content in Oxford Index
Reference entries
Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.
(1829—1917) geologist
HULL, Edward - Draughtsman, lithographer
HULL, Edward - Painter, watercolourist
Hull, Edward (1829-1917), geologist
HULL, Edward (1829 - 1917), consulting geologist
HULL, Hubert Charles Edward (1891 - 1939), late 1st Bn Queen's Royal Regt
CONNELL-SMITH, Gordon Edward (1917 - 2009), Professor of Contemporary History, University of Hull, 1973–85
56 For my much respected friends Mr Edward Hodgson & Mr Thomas Coats, Wardens of the worthy Society of the Trinity-house, in Kingstone upon Hull
SWEENEY, Walter Edward (born 1949), Solicitor, Yorkshire Law (formerly Walter Sweeney & Co.), 1997–2010; Consultant, Ingrams Solicitors, Hessle, 2010–12; Head of Probate, Williamsons Solicitors, Hull, 2013–14
MARRISON, Dr Geoffrey Edward (born 1923), Senior Fellow, South East Asian Studies, University of Hull, 2000–03 (Associate, Centre for South-East Asian Studies, 1989–91; Hon. Fellow, 1992–2003)
BERRY, Edward Arthur (1871 - 1949), Canon and Prebendary of York, 1926–47; Surrogate, 1914–47; Proctor in Convocation, 1921–47; Vicar of Drypool, 1914–47; Chaplain HM Prison, Hull, 1922–40; Chaplain Millitary Detention Barracks, 1940; OCF
MEADE, James Edward (1907 - 1995), Hon. Dr, Universities of Basel, Bath, East Anglia, Essex, Glasgow, Hull, Oxford and Athens; Hon. Fellow: London School of Economics; Oriel College, Oxford; Hertford College, Oxford; Christ's College, Cambridge; Trinity College, Cambridge
DENYER, Stanley Edward (1869 - 1931), Specialist in Nervous Diseases and in Medicine, Ministry of Pensions; late Senior Hon. Physician, Hull Royal Infirmary; late temporary Lecturer on Anatomy, Liverpool University; Captain RAMC; late Examiner in Anatomy, Cambridge University; Member of Senate Camb. University; late Demonstrator in Anatomy, Camb. University Medical School; Lecturer on Orthopædic Anatomy and Surgeon, Alden Hey Military Hospital; late Director of Studies in Natural Science, Queens' College, Cambridge; late Aural Surgeon, Hull and East Yorks Deaf and Dumb Institute
Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.


text:
So then: the Carrie remake.
Some 36 years after Stephen King's bestseller morphed into a movie — scaring the pig's blood bejesus out of us, and turning such lines as, "They're all gonna laugh at you!" into one for the ages — a re-do is in the works.
Directed by Kimberly Peirce, and with the promising young Chloë Moretz (Hugo, Kick-Ass) confirmed as the innocent essayed by Sissy Spacek in the original, the movie's gunning, I hear, for a Toronto shoot this year.[np-related]
But there's at least one agnostic out there about the project — and that would be King himself. Famously disapproving of the Stanley Kubrick adaptation of The Shining, he's always had a soft spot for Brian De Palma's virtuosic take on Carrie, and as recently as last year, he was getting grumpy about a new-gen Carrie.
Asked about it in Entertainment Weekly, he ventured, "The real question is why, when the original was so good? I mean, it's not Casablanca or anything, but it's a really good horror-suspense film, much better than the book. Piper Laurie really got her teeth into the bad-mom thing."
"I guess I could get behind it if they turned the project over to one of the Davids: Lynch or Cronenberg," he went on.
Give or take a David, I think Peirce is actually not a bad choice. Her most famous film, Boys Don't Cry, does after all share some of the same thematic tics as Carrie (give or take the transgendered!), and she has shown a capacity to manifest dread. Plus, with both Jodie Foster and Julianne Moore in consideration for the role of the horror-bile mom, as the trades have been saying, the remake could just work. (As long as they don't go down the route of Carrie: The Musical, which famously flopped on Broadway! And let's not even get into The Rage: Carrie 2 circa 1999!)
I'll be keeping close tabs on this one.
Here! There!
• Running for premier/mayor? Child's play! At least when compared to keeping social bunnies at a gala shush — as John Tory will find out when the politico-turned-radio-man hosts the 2012 Canadian Stage Theatre Ball dubbed Roulette & Romance, happening March 29 at The Fairmont Royal York in Toronto.
• "Prawns in coconut masala" and "lamb popsicles" were not even the half of it at the one-night-only pop-up restaurant that Canada's top Indian chef, Vikram Vij, cooked up for a select crew inside All the Best Fine Foods, in Rosedale, the other night.
There! Here!
• That's some pull: New York City Mayor Mike Bloomberg himself has RSVPed to the opening bash Thursday of the Joe Fresh flagship in N.Y.C. His Gotham worship is expected to join more than 800 art, fashion and media types — plus the full Weston set of both Galens, Hilary and Alannah — at this reverse-Canadian-manifest-destiny-taking on Fifth Avenue. Among those also expected? Model Jessica Stam and Oprah's BFF, Gayle King — all of whom will enjoy the premieres of three fashion videos commissioned for the event by Joe Mimran, and concocted by not-kidding-around industry giants Ellen von Unwerth, Sue de Beer and Deborah Turbeville.
• Well, goodbye to all that. As the last few hours dragged at the now-gone Avenue bar, in the "old" Toronto Four Seasons, a good contingent crammed for one last lunch on Sunday. As the various ghosts struck a chord — "Remember the time Ed Norton shared a bottle of red here with Bruce Springsteen?" — one of the customers enjoyed a particularly fun exchange that … well … he couldn't help but share. Customer to server during that last hurrah: "So, what are you going to do now?" Server to customer: "I'm going to Colombia to get a face lift."


text:
Sub-categories in this category:
|Education (1343)
|Food and Drinks (361)
|Languages and Linquistics (182)
Featured URLs in this category:
Arab Facebook-Chat Maktoob
Arab Facebook, Chat Maktoob, Arab Youtube, Arab Flickr clones,
URLs listed in this category:
California Child Visitation
For California child visitation, Monitored Visitation Services is one of the most trusted supervised visitation provides. Contact us today for info.
Catholic Expert
A free Catholic resource where Catholics can find prayer and info on the catholic faith. There are over 1000 prayers in English, Spanish and Italian, Catholic ecards, a daily prayer email, a prayer finder page and a monthly catholic newsletter.
Civil Rights Laws
Find resource about law and Seattle, information about legal topics, significant personal injury settlements
Early Childhood Education and Care
Kids EduCare is all about Bringing up small children through proper EDUCATION and CARE! Let us all join hands in making a BETTER TOMORROW!! Early childhood education refers to the formal teaching of young children by people outside the family or in set
Find Purpose in Life
Deals with college life questions: sex, relationships, purpose in life, handling stress, questions about God. Contains articles, videos, podcasts. You can email a question and get a person email reply.
Friend networking site-friend networking online.
zigime: Connecting people to the world. we offer a social friend networking site and social network community for all people.
Funny Christmas Song Lyrics
Holiday season poems and songs. Over 200 Christmas song lyrics in various languages - English, Spanish and German.
Halloween Party
Includes party and costume ideas, masks, crafts, recipes, coloring pages, Hallween games for kids, and pumpkin decorating tips.
Ioannis John Neocleous
NCI Estates - Leaders in Cyprus Law, Ioannis John Neocleous, Cyprus Lawyers, Cyprus Company Registration, Offshore Company Registration, European Lawyers, Cyprus Trusts, Cyprus Law, Admiralty and Shipping, Banking and Finance, Corporate and commercial, E
YourAstrologyGuru:A Complete Solution of Astrolog
ourAstrologyGuru.com provides solution of all your problems related to your life,career,buisness,health coming in your regular life.
1000s Russian women BeHappy2day
Gorgeous Russian girls want to meet foreign guy to date. Risk-Free No- Cost membership takes a few moments to register. Browse photo profiles, watch videos, write and receive emails from young attractive girls.
12 Chinese Zodiac Signs
Find your Chinese animal sign and compatible Chinese zodiac signs. Learn about the 12 Chinese zodiac signs; character descriptions, lucky numbers, celebrities, and marriage compatibility.
2007 Chinese astrology Forecast-Horoscopes of Pig
You can forecast your luck in Lunar Chinese New Year of Pig for your Zodiac Animal signs in Chinese calendar 2007. Chinese astrology horoscopes are composed with 12 Animals: Rat, Ox, Tiger, Rabbit, Dragon, Snake, Horse, Goat, Monkey, Rooster, Dog, and P
2008 Chinese Horoscope Forecast
Provide 2008 Chinese horoscope forecast for 12 Chinese horoscope signs. Also offer 2008 Feng Shui fortune predictions.
2011 Award Winner Michael Mortorano
The Man of the Year 2011 award winner Michael Mortorano, broke the record since 1976 with the biggest percentage of votes. He has spent most of this year aiding various charities and helped the logistics industry revolutionize the way they do business to
24-7PrayerOnline.com - Online Prayer Requests
Submit your prayer requests online and agree with other christian believers as they pray for you and your need. Pray for someone and also share your praise reports
2Nd Hand Wholesale Wedding Dress
A terrific brief paraphernalia of prevalent wedding outfit colors. Generally, the colour should be chosen keeping the complexion of the bride in your head. [ Read More ]
35 Bible Study Methods To Try
Discover the rich spiritual treasures that God has for you in the Bible. Learn how to read the Bible more effectively and how to study the Bible personally. There are over 35 different Bible study methods that you can use today to study the Bible.
38,500 Sermon Illustrations, Quotes & Jokes
Create an emotional connection with your audience by sharing from 38,500 inspirational quotes, humor, jokes and sermon illustrations. Dynamic computer program that stores and retrieves inspirational quotes, humor, jokes, and sermon illustrations.
4 my lovee | Relationships | Real Love Stories | L
Send your love story with your photos. Send your love message with photos! Read other love messages and vote them. Find love messages written for you! Good romantic love messages, love poems and love quotes. Say your love here!
40 Days of Prayer for You at the Kotel
Torah-observant and dedicated yeshiva students and teachers will pray 40 consecutive days for you at the Western Wall in Jerusalem (to find a spouse, regain health, bear children, have financial, career or other success and more.
A Beginner's Information To Purchase On The Web
Kiev is alive not only because of its magnificent properties or lively scenery. Such licences are far better attuned to market standards. [ Read More ]
A best place where you can find your life partner!
SaatPhere is an indian matrimonial site helps members in marriage, wedding and friendship. Saat Phere is a great desi portal to provide an opportunity to get to know each other.
A Collection of Useful Women's Tips and Guides
Useful information for women. A comprehensive collection of women's tips, guides and resources. Interesting women's ideas, personal opinions and much more.
A friend in need is a acquaintance indeed
Friendship is one of the most mysterious things. No one can tell how people select friends and whether they choose acquaintances.