公开(公告)号：AU1437000A

公开(公告)日：2000-06-05

申请号：AU1437000

申请日：1999-11-12

Applicant: ERICSSON TELEFON AB L M

Inventor： HOLMBERG PER ANDERS ,  LINNERMARK NILS OLA ,  STROMBERGSON KARL OSCAR JOACHI ,  EGELAND TERJE ,  CARLSSON MAGNUS

IPC: G06F9/38 ,  G06F9/46 ,  G06F9/50 ,  G06F15/177 ,  G06F15/16

公开(公告)号：AU1436900A

公开(公告)日：2000-06-05

申请号：AU1436900

申请日：1999-11-12

Applicant: ERICSSON TELEFON AB L M

Inventor： HOLMBERG PER ANDERS ,  KLING LARS-ORJAN ,  JOHNSON STEN EDWARD ,  EGELAND TERJE

IPC: G06F15/16 ,  G06F9/38 ,  G06F9/46 ,  G06F9/50 ,  G06F9/52 ,  G06F15/173 ,  G06F15/80 ,  H04Q3/545

Abstract: The invention generally relates to a processor developed for a service network that provides various services to a plurality of users connected to the network. The processor (30; 50) comprises a job queue (52) with a number of storage positions for storing job signals corresponding to jobs that form part of substantially independent services requested by the users of the network, and a plurality of parallel processing units (54) which independently process job signals from different storage positions of the job queue (52) to execute corresponding jobs in parallel. As a number of jobs are executed speculatively, a unit (56) for checking for possible dependencies between the executed jobs is incorporated into the processor. If a dependency is detected for a speculative job, that job is flushed. To ensure prompt and proper service for the users of the service network, flushed jobs are quickly restarted directly from the job queue.

公开(公告)号：SE9902373D0

公开(公告)日：1999-06-22

申请号：SE9902373

申请日：1999-06-22

Applicant: ERICSSON TELEFON AB L M

Inventor： EGELAND TERJE ,  KLING LARS-OERJAN ,  JOHNSON STEN EDVARD ,  HOLMBERG PER ANDERS

IPC: G06F9/38 ,  G06F9/46 ,  G06F9/50 ,  G06F12/02 ,  G06F13/38 ,  G06F

Abstract: In general, the invention is directed towards a multiprocessing system in which jobs are speculatively executed in parallel by multiple processors (30-1, 30-2, ..., 30-N). By speculating on the existence of more coarse-grained parallelism, so-called job-level parallelism, and backing of to sequential execution only in cases where dependencies that prevent parallel execution of jobs are detected, a high degree of parallelism can be extracted. According to the invention a private memory buffer is speculatively allocated for holding results, such as a communication message, an operation system call or a new job signal, of a speculatively executed job, and these results are speculatively written directly into the allocated memory buffer. When commit priority is assigned to the speculatively executed job, a pointer referring to the allocated memory buffer is transferred to an input/output (10) device which may access the memory buffer by means of the transferred pointer. In this way, by speculatively writing messages and signals into private memory buffers, even further parallelism can be extracted.

公开(公告)号：SE9901146D0

公开(公告)日：1999-03-29

申请号：SE9901146

申请日：1999-03-29

Applicant: ERICSSON TELEFON AB L M

Inventor： KLING LARS-OERJAN ,  JOHNSSON STEN EDVARD ,  HOLMBERG PER ANDERS ,  EGELAND TERJE

IPC: G06F9/48 ,  G06F9/50 ,  G06F

公开(公告)号：FI89985C

公开(公告)日：1993-12-10

申请号：FI872342

申请日：1987-05-27

Applicant: ERICSSON TELEFON AB L M

Inventor： SUNDELL HANS ENAR ,  EGELAND TERJE ,  JOHNSON STEN EDVARD ,  FRIMAN ERIK BERTIL

IPC: G06F12/08

公开(公告)号：MX169065B

公开(公告)日：1993-06-21

申请号：MX693987

申请日：1987-06-15

Applicant: ERICSSON TELEFON AB L M

Inventor： FRIMAN ERIK BERTIL ,  SUNDELL HANS ENAR ,  EGELAND TERJE ,  JOHNSON STEN EDVARD

IPC: G06F12/08 ,  G06F9/28

Abstract: A method and apparatus for determining what programme shall utilise a rapid access memory in a computer working with a plurality of programmes and having a conventional slow access (NM) memory and a rapid access memory (CM), characterized in that during a test period there registered for each programme the number of instructions in the programme requiring access to the memory, this number being divided by the whole memory space required by a programme, the quotients formed after each other in this way being compared with each other and for the programme with the highest quotient the memory content is transferred from the slow access memory to the rapid access memory. For each programme there is registered with the aid of a counter means (RF) the number of instructions requiring access to the slow access memory (NM). This number is divided with the aid of a measuring circuit (R1, R2, JR, KB) by the entire memory space for the respective programme noted in a space memory (SM). For the programme with the highest quotient the memory content is transferred from the relatively slow access memory (NM) to the rapid access memory (CM). An address memory (AM) is arranged, and for the programme information transferred from the slow access memory (NM) to the rapid access memory (CM) the address memory reads out the starting address of the programme information in the rapid access memory (CM) on addressing a starting address in the slow access memory (NM)>

公开(公告)号：DK166238B

公开(公告)日：1993-03-22

申请号：DK325187

申请日：1987-06-25

Applicant: ERICSSON TELEFON AB L M

Inventor： SUNDELL HANS ENAR ,  EGELAND TERJE ,  JOHNSON STEN EDVARD ,  FRIMAN ERIK BERTIL

IPC: G06F12/08

Abstract: A method and apparatus for determining what programme shall utilise a rapid access memory in a computer working with a plurality of programmes and having a conventional slow access (NM) memory and a rapid access memory (CM), characterized in that during a test period there registered for each programme the number of instructions in the programme requiring access to the memory, this number being divided by the whole memory space required by a programme, the quotients formed after each other in this way being compared with each other and for the programme with the highest quotient the memory content is transferred from the slow access memory to the rapid access memory. For each programme there is registered with the aid of a counter means (RF) the number of instructions requiring access to the slow access memory (NM). This number is divided with the aid of a measuring circuit (R1, R2, JR, KB) by the entire memory space for the respective programme noted in a space memory (SM). For the programme with the highest quotient the memory content is transferred from the relatively slow access memory (NM) to the rapid access memory (CM). An address memory (AM) is arranged, and for the programme information transferred from the slow access memory (NM) to the rapid access memory (CM) the address memory reads out the starting address of the programme information in the rapid access memory (CM) on addressing a starting address in the slow access memory (NM)>

公开(公告)号：CA1283487C

公开(公告)日：1991-04-23

申请号：CA539256

申请日：1987-06-09

Applicant: ERICSSON TELEFON AB L M

Inventor： SUNDELL HANS E ,  EGELAND TERJE ,  JOHNSON STEN E ,  FRIMAN ERIK B

IPC: G06F12/08

Abstract: A method and apparatus for determining which programme will utilise a rapid access memory in a computer working with a plurality of programmes and having a conventional slow access memory and a rapid access memory are described. During a test period there is registered for each programme the number of instructions in the programme requiring access to the memory, this number being divided by the whole memory space required by a programme, the quotients formed after each other in this way being compared with each other and for the programme with the highest quotient the memory content is transferred from the slow access memory to the rapid access memory. For each programme there is registered with the aid of a counter the number of instructions requiring access to the slow access memory. This number is divided with the aid of a measuring circuit by the entire memory space for the respective programme noted in a space memory. For the programme with the highest quotient the memory content is transferred from the relatively slow access memory to the rapid access memory. An address memory is arranged, and for the programme information transferred from the slow access memory to the rapid access memory the address memory reads out the starting address of the programme information in the rapid access memory on addressing a starting address in the slow access memory.

公开(公告)号：HK7591A

公开(公告)日：1991-02-01

申请号：HK7591

申请日：1991-01-24

Applicant: ERICSSON TELEFON AB L M

Inventor： SUNDELL HANS ENAR ,  EGELAND TERJE ,  JOHNSSON STEN EDVARD ,  FRIMAN ERIK BERTIL

IPC: G06F12/08

Abstract: A method and apparatus for determining what programme shall utilise a rapid access memory in a computer working with a plurality of programmes and having a conventional slow access (NM) memory and a rapid access memory (CM), characterized in that during a test period there registered for each programme the number of instructions in the programme requiring access to the memory, this number being divided by the whole memory space required by a programme, the quotients formed after each other in this way being compared with each other and for the programme with the highest quotient the memory content is transferred from the slow access memory to the rapid access memory. For each programme there is registered with the aid of a counter means (RF) the number of instructions requiring access to the slow access memory (NM). This number is divided with the aid of a measuring circuit (R1, R2, JR, KB) by the entire memory space for the respective programme noted in a space memory (SM). For the programme with the highest quotient the memory content is transferred from the relatively slow access memory (NM) to the rapid access memory (CM). An address memory (AM) is arranged, and for the programme information transferred from the slow access memory (NM) to the rapid access memory (CM) the address memory reads out the starting address of the programme information in the rapid access memory (CM) on addressing a starting address in the slow access memory (NM)>

公开(公告)号：DK325187D0

公开(公告)日：1987-06-25

申请号：DK325187

申请日：1987-06-25

Applicant: ERICSSON TELEFON AB L M

Inventor： SUNDELL HANS ENAR ,  EGELAND TERJE ,  JOHNSON STEN EDVARD ,  FRIMAN ERIK BERTIL

IPC: G06F12/08 ,  G06F9/06 ,  G06F12/00

Abstract: A method and apparatus for determining what programme shall utilise a rapid access memory in a computer working with a plurality of programmes and having a conventional slow access (NM) memory and a rapid access memory (CM), characterized in that during a test period there registered for each programme the number of instructions in the programme requiring access to the memory, this number being divided by the whole memory space required by a programme, the quotients formed after each other in this way being compared with each other and for the programme with the highest quotient the memory content is transferred from the slow access memory to the rapid access memory. For each programme there is registered with the aid of a counter means (RF) the number of instructions requiring access to the slow access memory (NM). This number is divided with the aid of a measuring circuit (R1, R2, JR, KB) by the entire memory space for the respective programme noted in a space memory (SM). For the programme with the highest quotient the memory content is transferred from the relatively slow access memory (NM) to the rapid access memory (CM). An address memory (AM) is arranged, and for the programme information transferred from the slow access memory (NM) to the rapid access memory (CM) the address memory reads out the starting address of the programme information in the rapid access memory (CM) on addressing a starting address in the slow access memory (NM)>