[특허]Packet processor that generates packet-start offsets to immediately store incoming streamed packets using parallel, staggered round-robin arbitration to interleaved banks of memory

Consentry Networks, Inc.

검색어에 아래의 연산자를 사용하시면 더 정확한 검색결과를 얻을 수 있습니다.
검색연산자

검색도움말
검색연산자	기능	검색시 예
()	우선순위가 가장 높은 연산자	예1) (나노 (기계 \| machine))
공백	두 개의 검색어(식)을 모두 포함하고 있는 문서 검색	예1) (나노 기계) 예2) 나노 장영실
\|	두 개의 검색어(식) 중 하나 이상 포함하고 있는 문서 검색	예1) (줄기세포 \| 면역) 예2) 줄기세포 \| 장영실
!	NOT 이후에 있는 검색어가 포함된 문서는 제외	예1) (황금 !백금) 예2) !image
*	검색어의 *란에 0개 이상의 임의의 문자가 포함된 문서 검색	예) semi*
""	따옴표 내의 구문과 완전히 일치하는 문서만 검색	예) "Transform and Quantization"

과학기술 지식인프라 ScienceON

연합인증

연합인증 가입 기관의 연구자들은 소속기관의 인증정보(ID와 암호)를 이용해 다른 대학, 연구기관, 서비스 공급자의 다양한 온라인 자원과 연구 데이터를 이용할 수 있습니다.

이는 여행자가 자국에서 발행 받은 여권으로 세계 각국을 자유롭게 여행할 수 있는 것과 같습니다.

연합인증으로 이용이 가능한 서비스는 NTIS, DataON, Edison 등이 있습니다.

한번의 인증절차만으로 연합인증 가입 서비스에 추가 로그인 없이 이용이 가능합니다.

다만, 연합인증을 위해서는 최초 1회만 인증 절차가 필요합니다. (회원이 아닐 경우 회원 가입이 필요합니다.)

연합인증 절차는 다음과 같습니다.

최초이용시에는
ScienceON에 로그인 → 연합인증 서비스 접속 → 로그인 (본인 확인 또는 회원가입) → 서비스 이용

그 이후에는
ScienceON 로그인 → 연합인증 서비스 접속 → 서비스 이용

연합인증을 활용하시면 KISTI가 제공하는 다양한 서비스를 편리하게 이용하실 수 있습니다.

특허 상세정보

MyON담기

내보내기 페이스북 공유 트위터 공유 카카오톡 공유

Packet processor that generates packet-start offsets to immediately store incoming streamed packets using parallel, staggered round-robin arbitration to interleaved banks of memory

특허상세정보
국가/구분	United States(US) Patent 등록
국제특허분류(IPC7판)	G06F-012/00 G06F-013/00 G06F-013/28 G06F-013/20
미국특허분류(USC)	711/151; 711/147; 711/148; 711/149; 711/150; 711/202; 370/395.4; 370/395.41; 370/395.42; 370/375; 370/376; 709/214; 709/215; 709/240
출원번호	UP-0309662 (2006-09-07)
등록번호	US-7634622 (2009-12-24)
발명자 / 주소	Musoll, Enrique Nemirovsky, Mario Huynh, Jeffrey
출원인 / 주소	Consentry Networks, Inc.
대리인 / 주소	gPatent LLC
인용정보	피인용 횟수 : 10 인용 특허 : 22

초록
▼

A shared memory stores packets for a packet processor. The shared memory is arranged into banks that are word-interleaved. All banks may be accessed in parallel during each time-slot by different requesters. A staggered round-robin arbiter connects requesters to banks in a parallel fashion. Requestor inputs to the arbiter are staggered to allow access to different banks in a sequential order over successive time-slots. Multi-processor tribes have many processors that generate random requests to the shared memory. A slot scheduler arranges these random requests into a stream of sequential requests that are synchronized to the staggered round-robin arbiter. A packet interface requestor stores incoming packets from an external network into the shared memory. The packet's offset within pages of the shared memory is determined by the first available bank that the packet can be written to, eliminating delays in storing incoming packets and spreading storage of frequently-accessed fields.

대표
청구항
▼

What is claimed is: 1. A bank-access scheduler comprising: a plurality of requester inputs for carrying requests for memory access to a shared memory from a plurality of requestors; a plurality of bank interfaces to the shared memory, each bank interface for accessing a bank of the shared memory, wherein banks are interleaved with a bank granularity; a plurality of request selectors coupled to the plurality of bank interfaces, each request selector for selecting a selected requester from the plurality of requester inputs to the request selector; and staggering means for staggering connection of the plurality of request inputs to the plurality of bank interfaces wherein each request input is connected to a different bank interface in the plurality of bank interfaces for each time-slot in a sequence of time-slots; wherein the plurality of requesters comprises: a packet interface for requesting writing of incoming packets from an external network to the shared memory; a plurality of multi-processor tribes, each multi-processor tribe comprising a plurality of processors, each processor for operating on a packet written to the shared memory by the packet interface; wherein an incoming packet from the packet interface is written to a next-available bank in the shared memory; wherein a first bank in the shared memory is a page-start bank for storing a start of an aligned page; wherein an offset bank in the shared memory does not contain the start of the aligned page; wherein the aligned page starts at an address having all zero address bits for address bits having a significance less than a size of the aligned page; wherein the next-available bank is an offset bank when the incoming packet arrives when the first bank is not immediately available to be written by the packet interface; whereby requests are connected to banks of the shared memory in a staggered fashion and whereby incoming packets are able to be written to the offset bank as the next-available bank. 2. The bank-access scheduler of claim 1 wherein the staggering means comprises staggering connections of requestor inputs to physical inputs to the plurality of request selectors, wherein each requestor input is applied to different logical inputs in a sequence of logical inputs of each request selector, whereby physical connection of inputs to the plurality of request selectors is staggered. 3. The bank-access scheduler of claim 1 wherein the sequence of time-slots comprises 8 time-slots; wherein the plurality of request selectors comprises 8 request selectors and the shared memory comprises 8 banks. 4. A bank-access scheduler comprising: a plurality of requestor inputs for carrying requests for memory access to a shared memory from a plurality of requesters; a plurality of bank interfaces to the shared memory, each bank interface for accessing a bank of the shared memory, wherein banks are interleaved with a bank granularity; a plurality of request selectors coupled to the plurality of bank interfaces, each request selector for selecting a selected requestor from the plurality of requestor inputs to the request selector; and staggering means for staggering connection of the plurality of request inputs to the plurality of bank interfaces wherein each request input is connected to a different bank interface in the plurality of bank interfaces for each time-slot in a sequence of time-slots; a time-slot counter for generating a count value that varies for each time-slot in the sequence of time-slots; wherein the count value is applied as a select input to the plurality of request selectors; a packet-offset generator, coupled to the time-slot counter, for generating a packet offset that indicates a starting location within a page in the shared memory for storage of an incoming packet; wherein the packet offset is a function of the count value from the time-slot counter whereby the count value controls selection by the plurality of request selectors and whereby requests are connected to banks of the shared memory in a staggered fashion. 5. The bank-access scheduler of claim 4 wherein the packet offset is generated as the count value from the time-slot counter multiplied by the bank granularity. 6. The bank-access scheduler of claim 5 wherein incoming packets have a size that is variable from packet to packet. 7. A bank-access scheduler comprising: a plurality of requester inputs for carrying requests for memory access to a shared memory from a plurality of requesters; a plurality of bank interfaces to the shared memory, each bank interface for accessing a bank of the shared memory, wherein banks are interleaved with a bank granularity; a plurality of request selectors coupled to the plurality of bank interfaces, each request selector for selecting a selected requester from the plurality of requester inputs to the request selector; and staggering means for staggering connection of the plurality of request inputs to the plurality of bank interfaces wherein each request input is connected to a different bank interface in the plurality of bank interfaces for each time-slot in a sequence of time-slots; wherein each multi-processor tribe further comprises: a slot scheduler receiving random-access requests from a plurality of processors, for generating a stream of requests for access to the banks of the shared memory in a sequence of banks that are accessible by the slot scheduler during the sequence of time-slots; wherein the slot scheduler further comprises: a priority counter that advances through a priority sequence when a processor in the plurality of processors has a requests selected for access to the banks; a direction bit that is toggled when the priority counter wraps around to a reset value, the direction bit indicating a direction of priority in the priority sequence; and a request selector that chooses a highest-priority request from the plurality of processors using the priority sequence and the direction bit, wherein request starvation is prevented and a minimum worst-case latency is provided; whereby requests are connected to banks of the shared memory in a staggered fashion and whereby random-access requests are converted to the stream of requests to banks of the shared memory in the sequence of banks. 8. A packet-processing system comprising: a shared memory divided into a plurality of banks, the plurality of banks being word-interleaved, wherein successive words in a stream of words having a sequence of word-incremented addresses are stored to successive banks in the plurality of banks; a plurality of requesters that request access to the shared memory, the plurality of requesters comprising: a packet interface coupled to an external network, the packet interface receiving incoming packets from the external network and outputting egress packets to the external network; a first multi-processor tribe; wherein the first multi-processor tribe comprises: a plurality of processors, each processor for operating on a packet initially stored in the shared memory by the packet interface; and a slot scheduler that receives requests from the plurality of processors and generates a pseudo-sequential stream of requests to successive banks in the plurality of banks; wherein the plurality of requesters form a looping list of requestors; a parallel staggered round-robin arbiter for connecting the plurality of requesters to the plurality of banks to allow parallel accesses to the shared memory during a time-slot, the parallel staggered round-robin arbiter comprising a plurality of selectors, each selector for controlling access to a bank in the plurality of banks; wherein each selector selects successive requesters in the looping list of requesters during successive time-slots; wherein each selector selects a different requester in the looping list of requesters for a first time-slot; an offset generator, activated by the packet interface writing a start of an incoming packet to a selected bank in the plurality of banks, the offset generator generating an offset for the incoming packet that specifies the selected bank in the plurality of banks; wherein the selected bank is able to be selected from any bank in the plurality of banks; wherein the offset is sent to an assigned processor in the plurality of processors for the first multi-processor tribe when the assigned processor is instructed to begin operating on the incoming packet stored in the shared memory; whereby the offset is generated and sent to the assigned processor to indicate the selected bank storing the start of the incoming packet and whereby selectors stagger selection of successive requesters in the looping list of requesters to successive banks for parallel access to the shared memory. 9. The packet-processing system of claim 8 further comprising: a second multi-processor tribe; wherein the second multi-processor tribe comprises: a second plurality of processors, each processor for operating on a packet initially stored in the shared memory by the packet interface; and a second slot scheduler that receives requests from the second plurality of processors and generates a pseudo-sequential stream of requests to successive banks in the plurality of banks; wherein the plurality of banks comprises 8 banks and the looping list of requesters comprises 8 requesters, wherein 8 banks are accessible in parallel for each time-slot. 10. The packet-processing system of claim 9 wherein the plurality of requesters further comprises: a control interface for sending data from the shared memory to an external host processor. 11. A packet-processing system comprising: a shared memory divided into a plurality of banks, the plurality of banks being word-interleaved, wherein successive words in a stream of words having a sequence of word-incremented addresses are stored to successive banks in the plurality of banks; a plurality of requesters that request access to the shared memory, the plurality of requesters comprising: a packet interface coupled to an external network, the packet interface receiving incoming packets from the external network and outputting egress packets to the external network; a first multi-processor tribe; wherein the first multi-processor tribe comprises: a plurality of processors, each processor for operating on a packet initially stored in the shared memory by the packet interface; and a slot scheduler that receives requests from the plurality of processors and generates a pseudo-sequential stream of requests to successive banks in the plurality of banks; wherein the plurality of requesters form a looping list of requestors; a parallel staggered round-robin arbiter for connecting the plurality of requesters to the plurality of banks to allow parallel accesses to the shared memory during a time-slot, the parallel staggered round-robin arbiter comprising a plurality of selectors, each selector for controlling access to a bank in the plurality of banks; wherein each selector selects successive requesters in the looping list of requesters during successive time-slots; wherein each selector selects a different requester in the looping list of requesters for a first time-slot; wherein the slot scheduler comprises: a bank counter, synchronized to the parallel staggered round-robin arbiter, for generating a bank count indicating a current bank in the plurality of banks that the multi-processor tribe can access during a current time-slot; a bank matcher, receiving a plurality of requests from the plurality of processors in the multi-processor tribe, for selecting matching requests matching the bank count from the bank counter; and a prioritizer that selects a current request from the matching requests from the bank matcher, the current request being sent to the parallel staggered round-robin arbiter during the current time-slot for access to the current bank, whereby multiple requests from processors are matched to the bank count and prioritized to select the current request and whereby selectors stagger selection of successive requesters in the looping list of requesters to successive banks for parallel access to the shared memory. 12. The packet-processing system of claim 11 wherein each selector comprises an N-to-1 multiplexer for selecting from among N requesters in the looping list of requestors. 13. The packet-processing system of claim 11 wherein a frequently-accessed field of the incoming packet is able to be stored in any bank in the plurality of banks, whereby frequently-accessed fields of a plurality of incoming packets are stored across all banks of the shared memory. 14. A method for streaming an incoming packet into a shared memory for operating on the incoming packet in a packet processor comprising: receiving the incoming packet from an external network at a packet interface; determining a next bank in a plurality of interleaved banks, the next bank being accessible by the packet interface during a next time-slot while other banks in the plurality of interleaved banks are not accessible by the packet interface during the next time-slot; writing a start of the incoming packet to the next bank during the next time-slot; subsequently writing a remainder of the incoming packet to a sequence of banks in the plurality of banks over a sequence of time-slots that follow the next time-slot; generating a packet offset for the incoming packet from an indicator of the next bank, the packet offset indicating an offset from a start of a page aligned to a first bank in the plurality of banks; and sending the offset and a page identifier that identifies a memory page containing the incoming packet to an assigned processor in a plurality of processors, whereby incoming packets are streamed into the shared memory at offsets to memory pages. 15. The method of claim 14 further comprising: operating on the incoming packet by executing instructions on the assigned processor, and reading the incoming packet in the shared memory by requesting access to the shared memory using the offset and page sent to the assigned processor to locate the incoming packet in the shared memory, wherein the start of the incoming packet is stored to the next bank before the offset is sent to the assigned processor.

이 특허에 인용된 특허 (22)

이 특허를 인용한 특허 (10)

IPC 상위 출원인

내보내기

상세정보
내보내기 구분	파일저장 인쇄 메일전송
구성항목	관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표IPC 관리번호, 국가코드, 자료구분, 상태, 출원번호, 출원일자, 공개번호, 공개일자, 공고번호, 공고일자, 등록번호, 등록일자, 발명명칭(한글), 발명명칭(영문), 출원인(한글), 출원인(영문), 출원인코드, 대표출원인, 출원인국적, 출원인주소, 발명자, 발명자E, 발명자코드, 발명자주소, 발명자 우편번호, 발명자국적, 대표IPC, IPC코드, 요약, 미국특허분류, 대리인주소, 대리인코드, 대리인(한글), 대리인(영문), 국제공개일자, 국제공개번호, 국제출원일자, 국제출원번호, 우선권, 우선권주장일, 우선권국가, 우선권출원번호, 원출원일자, 원출원번호, 지정국, Citing Patents, Cited Patents
저장형식	Text(ASCII format) Excel format PIAS분석(.xls)
메일정보	받는사람 (필수) @ 보내는사람 (선택) @ 제목 내용 KISTI 검색결과 이메일 서비스
안내	> 총 건의 자료가 검색되었습니다. > 다운받으실 자료의 인덱스를 입력하세요. (1-10,000) > 검색결과의 순서대로 최대 10,000건 까지 다운로드가 가능합니다. > 데이타가 많을 경우 속도가 느려질 수 있습니다.(최대 2~3분 소요) > 다운로드 파일은 UTF-8 형태로 저장됩니다. 파일의 내용이 제대로 보이지 않을실 때는 웹브라우저 상단의 보기 -> 인코딩 -> 자동선택 여부를 확인하십시오 > ~ > Text(ASCII format) Excel format

과학기술 지식인프라 ScienceON

ScienceON Chatbot

연합인증

특허 상세정보

Packet processor that generates packet-start offsets to immediately store incoming streamed packets using parallel, staggered round-robin arbitration to interleaved banks of memory

초록
▼

대표
청구항
▼

이 특허에 인용된 특허 (22)

이 특허를 인용한 특허 (10)

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

ScienceON Chatbot

연합인증

특허 상세정보

Packet processor that generates packet-start offsets to immediately store incoming streamed packets using parallel, staggered round-robin arbitration to interleaved banks of memory

초록 ▼

대표청구항 ▼

이 특허에 인용된 특허 (22)

이 특허를 인용한 특허 (10)

IPC 상위 출원인

과제정보

상세정보조회

원문조회

IPC 상세정보(version : 201201)

연구과제 성과물(0)

참여연구원의 다른 문헌(0)

처리중입니다.

잠시만 기다려주세요.

초록
▼

대표
청구항
▼